Reporting and Counting Intersections Between Two Sets of Line Segments
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- ProblemsJournal of Algorithms, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972