An optimal algorithm for computing a minimum nested nonconvex polygon
- 1 December 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (6) , 277-280
- https://doi.org/10.1016/0020-0190(90)90038-y
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Triangulating a simple polygon in linear timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An approximate algorithm for the minimal vertex nested polygon problemInformation Processing Letters, 1989
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- Visibility of a simple polygonComputer Vision, Graphics, and Image Processing, 1983