On geodesic properties of polygons relevant to linear time triangulation
- 1 January 1989
- journal article
- Published by Springer Nature in The Visual Computer
- Vol. 5 (1-2) , 68-74
- https://doi.org/10.1007/bf01901482
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
- A new triangulation-linear class of simple polygonsInternational Journal of Computer Mathematics, 1987
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- A new linear algorithm for triangulating monotone polygonsPattern Recognition Letters, 1984
- Applications of a two-dimensional hidden-line algorithm to other geometric problemsComputing, 1983
- Visibility of a simple polygonComputer Vision, Graphics, and Image Processing, 1983
- 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
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- Triangulating a simple polygonInformation Processing Letters, 1978