Abstract
Given an ordered family of n pairwise disjoint convex simple objects in the plane, we give an O( n) time algorithm for finding the directed line transversals of the family that intersect the objects in order. Objects are simple if they have a constant size storage description, and if the intersections and common tangents between any two objects can be found in constant time. Our O( n) time algorithm contrasts with an Ω( n log n) lower bound for finding a line transversal of a family of n convex simple objects in the plane.
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.
