Ray shooting in polygons using geodesic triangulations
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 1989
- Optimal shortest path queries in a simple polygonJournal of Computer and System Sciences, 1989
- The complexity of cutting complexesDiscrete & Computational Geometry, 1989
- Ray shooting and other applications of spanning trees with low stabbing numberPublished by Association for Computing Machinery (ACM) ,1989
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Fractional cascading: II. ApplicationsAlgorithmica, 1986
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983