Finding minimal nested polygons
From MaRDI portal
Publication:802901
DOI10.1007/BF01931283zbMATH Open0726.68084MaRDI QIDQ802901FDOQ802901
Authors: Cao An Wang
Publication date: 1991
Published in: BIT (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
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)