Abstract
We simplify the red/blue segment intersection algorithm of Chazelle et al. (Technical Report UIUC DCS-R-90-1578, Department of Computer Science, University of Illinois at Urbana, 1990). Given sets of n disjoint red and n disjoint blue segments, we count red/blue intersections in O( n log n) time using O( n) space or report them in additional time proportional to their number. Our algorithm uses a plane sweep to presort the segments; then it operates on a list of slabs that efficiently stores a single level of a segment tree. With no dynamic memory allocation, low pointer overhead, and mostly sequential memory reference, our algorithm performs well even with inadequate physical memory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.