Finding minimal nested polygons

DOI10.1007/BF01931283zbMATH Open0726.68084MaRDI QIDQ802901FDOQ802901

Authors: Cao An Wang 

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• Triangulating a simple polygon in linear time
• A linear time algorithm for minimum link paths inside a simple polygon
• An approximate algorithm for the minimal vertex nested polygon problem

Cited In (8)

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