Computing the link center of a simple polygon
Open Access
- 1 September 1988
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 3 (3) , 281-293
- https://doi.org/10.1007/bf02187913
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- A theorem on polygon cutting with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981
- Triangulating a simple polygonInformation Processing Letters, 1978
- Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen PunktenMonatshefte für Mathematik, 1930