Visibility and intersection problems in plane geometry
Open Access
- 1 December 1989
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (6) , 551-581
- https://doi.org/10.1007/bf02187747
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Computing on a free tree via complexity-preserving mappingsAlgorithmica, 1987
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Optimal shortest path queries in a simple polygonPublished by Association for Computing Machinery (ACM) ,1987
- Fractional cascading: II. ApplicationsAlgorithmica, 1986
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- A kinetic framework for computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976