Abstract
We have shown that a c-oriented polygon intersection query can be answered in O(log n+t) time using O(n log n) space, where n is the number of c-oriented polygons, each with a bounded number of edges, and t is the number of reported polygons.
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.
