Applications of a two-dimensional hidden-line algorithm to other geometric problems
- 1 September 1983
- journal article
- Published by Springer Nature in Computing
- Vol. 31 (3) , 191-202
- https://doi.org/10.1007/bf02263430
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- On a convex hull algorithm for polygons and its application to triangulation problemsPattern Recognition, 1982
- Finding the convex hull of a simple polygonPattern Recognition Letters, 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
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- Triangulating a simple polygonInformation Processing Letters, 1978
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972
- Some properties of L-sets in the planeDuke Mathematical Journal, 1949