Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
Authors:
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 64-73
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Applications of random sampling in computational geometry, II1988
- A fast Las Vegas algorithm for triangulating a simple polygon1988
- Polytope range searching and integral geometry1987
- Space searching for intersecting objectsJournal of Algorithms, 1987
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- Algorithms in Combinatorial Geometry1987
- Reporting and counting segment intersectionsJournal of Computer and System Sciences, 1986
- Topologically sweeping an arrangement1986
- Quadratic bounds for hidden line elimination1986