Finding minimal nested polygons

DOI10.1007/BF01931283MaRDI QIDQ802901zbMATH OpenFDO

Authors Cao An Wang

Publication date 1991

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

minimal nested polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Finding minimal convex nested polygons
• An approximate algorithm for the minimal vertex nested polygon problem
• Finding minimum area \(k\)-gons
• An optimal algorithm for computing a minimum nested nonconvex polygon
• Minimum-perimeter enclosures

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• A linear time algorithm for minimum link paths inside a simple polygon
• An approximate algorithm for the minimal vertex nested polygon problem
• Triangulating a simple polygon in linear time

Cited in

(8)

• An optimal algorithm for computing a minimum nested nonconvex polygon
• Computing minimum length paths of a given homotopy class
• Polygon nesting and robustness
• Finding minimal convex nested polygons
• Minimum-perimeter enclosures
• Finding the smallest triangles containing a given convex polygon
• On the geometric interpretation of the nonnegative rank
• Using symbolic calculations to determine largest small polygons

This page was built for publication: Finding minimal nested polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802901)