Reporting and counting segment intersections
- 1 April 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 32 (2) , 156-182
- https://doi.org/10.1016/0022-0000(86)90025-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Comments on “algorithms for reporting and counting geometric intersections”IEEE Transactions on Computers, 1981
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978