Abstract
We present a fully dynamic technique for point location in triangulations that allows a tradeoff between query and update time, and can be used in conjunction with any of the known static point location data structures. Let S be a triangulation whose current number of vertices is n. We show that for any smooth nondecreasing integer function b(n) with 2 ⩽b(n)⩽ n , there exists a dynamic point location data structure for S with space O( n), query time O( ( log 2n) log b(n) ) , and update time O( ( log 2n)b(n) log b(n) ) O((log 2 n) b( n)/log b( n)).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
