Abstract
Simple direct dynamic binary tree structures for two line segment problems are introduced. Both structures provide for O(log n) updating and querying and can be based on any balanced class of binary search trees, for example, AVL trees. The measure tree solves a nondecomposable searching problem, while the stabbing tree improves the known updating and querying time for its corresponding application.
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.
