Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Applications of random sampling in computational geometry, IIPublished by Association for Computing Machinery (ACM) ,1988
- A fast Las Vegas algorithm for triangulating a simple polygonPublished by Association for Computing Machinery (ACM) ,1988
- Polytope range searching and integral geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- 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 GeometryPublished by Springer Nature ,1987
- Reporting and counting segment intersectionsJournal of Computer and System Sciences, 1986
- Topologically sweeping an arrangementPublished by Association for Computing Machinery (ACM) ,1986
- Quadratic bounds for hidden line eliminationPublished by Association for Computing Machinery (ACM) ,1986