Finding minimal nested polygons

DOI10.1007/BF01931283zbMath0726.68084MaRDI QIDQ802901

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)

Related Items (2)

Computing minimum length paths of a given homotopy class ⋮ On the geometric interpretation of the nonnegative rank

Cites Work

• Unnamed Item
• Triangulating a simple polygon in linear time
• An approximate algorithm for the minimal vertex nested polygon problem
• A linear time algorithm for minimum link paths inside a simple polygon

This page was built for publication: Finding minimal nested polygons