Approximation Algorithms for the Minimum Convex Partition Problem

DOI10.1007/11785293_23zbMath1142.68615OpenAlexW1608309968MaRDI QIDQ5757909

Christian Knauer, Andreas Spillner

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_23

Mathematics Subject Classification ID

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

Related Items

Solving the minimum convex partition of point sets with integer programming, Computing optimal islands, Convex partitions with 2-edge connected dual graphs, Decomposing a simple polygon into pseudo-triangles and convex polygons, Minimum weight convex Steiner partitions