Abstract
A set of polygons is called c -oriented if the edges of all polygons are oriented in a constant number of previously defined directions. The intersection searching problem is studied for such objects, namely: Given a set of c -oriented polygons P and a c -oriented query polygon q , find all polygons in P that intersect q . It is shown that this problem can be solved in O (log 2 n + t ) time with O ( n log n ) space and O ( n log 2 n ) preprocessing, where n is the cardinality of P and t the number of answers to a query. Furthermore, the solution is extended to the cases in which P is a semidynamic or dynamic set of polygons. Whereas planar intersection searching can be carried out more efficiently for orthogonal objects (e.g., rectangles) it is expensive for arbitrary polygons. This suggests that the c -oriented solution be used in appropriate areas of application, for instance, in VLSI-design.
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.
