An approximate algorithm for the minimal vertex nested polygon problem

DOI10.1016/0020-0190(89)90185-3zbMath0763.68061OpenAlexW2036462575MaRDI QIDQ1812727

C. E. Veni Madhavan, Bhaskar Das Gupta

Publication date: 25 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90185-3

zbMATH Keywords

shortest-pathminimal vertex nested polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

An optimal algorithm for computing a minimum nested nonconvex polygon ⋮ Finding minimal nested polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Finding minimal convex nested polygons
• Visibility of a simple polygon
• On finding the convex hull of a simple polygon

This page was built for publication: An approximate algorithm for the minimal vertex nested polygon problem