Abstract
We present an efficient algorithm for the pointer machine model that preprocesses a set of n three-dimensional points in O(nlogn) worst case time to construct an O(n) space data structure that supports three-dimensional dominance reporting queries in O(logn + t) worst case time, when t points are reported. Previous results achieved either O(n 2) worst case or O(nlogn) expected preprocessing time. The novelty of our approach is that we employ persistent data structures and exploit geometric observations of previous works, in order to achieve a drastic reduction in the worst case preprocessing time.
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.
