An optimal algorithm for computing a minimum nested nonconvex polygon

DOI10.1016/0020-0190(90)90038-YzbMath0706.68096OpenAlexW1992514935MaRDI QIDQ918739

Anil Maheshwari, Subir Kumar Ghosh

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90038-y

zbMATH Keywords

computational geometryrelative convex hulllink pathnested polygon

Mathematics Subject Classification ID

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

Related Items (2)

Computing minimum length paths of a given homotopy class ⋮ Minimum vertex hulls for polyhedral domains

Cites Work

• Unnamed Item
• An approximate algorithm for the minimal vertex nested polygon problem
• A linear time algorithm for minimum link paths inside a simple polygon
• Visibility of a simple polygon
• Euclidean shortest paths in the presence of rectilinear barriers
• Computing the visibility polygon from a convex set and related problems
• Finding the convex hull of a simple polygon

This page was built for publication: An optimal algorithm for computing a minimum nested nonconvex polygon