A counterexample to an algorithm for computing monotone hulls of simple polygons
- 31 May 1983
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 1 (4), 219-222
- https://doi.org/10.1016/0167-8655(83)90028-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- 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
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981
- Convex hull of a finite set of points in two dimensionsInformation Processing Letters, 1978
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972