The furthest-site geodesic voronoi diagram
Authors:
Open Access
- 1 March 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 9 (3) , 217-255
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 1989
- Computing the geodesic center of a simple polygonDiscrete & Computational Geometry, 1989
- Computing geodesic furthest neighbors in simple polygonsJournal of Computer and System Sciences, 1989
- On the geodesic voronoi diagram of point sites in a simple polygonAlgorithmica, 1989
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Computational Geometry1985
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Triangulating a simple polygonInformation Processing Letters, 1978