Computing optimal diameter-bounded polygon partitions

DOI10.1007/S00453-004-1092-3MaRDI QIDQ1882473zbMATH OpenOpenAlexFDO

Authors Mirela Damian, Sriram Pemmaraju

Publication date 1 October 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1092-3

zbMATH Keywords

approximation algorithmpolygon decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)

Recommendations

• Algorithms for minimum length partitions of polygons
• scientific article; zbMATH DE number 177549
• A decision procedure for optimal polyhedron partitioning
• A parallel algorithm for partitioning a point set to minimize the maximum of diameters
• scientific article; zbMATH DE number 867650
• Approximation algorithms for partitioning a rectangle with interior points
• Computing area-optimal simple polygonizations
• Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
• Computing partitions of rectilinear polygons with minimum stabbing number
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm

Cited in

(4)

• scientific article; zbMATH DE number 867650 (Why is no real title available?)
• Algorithms for minimum length partitions of polygons
• A decision procedure for optimal polyhedron partitioning
• Approximation algorithms for partitioning a rectangle with interior points

This page was built for publication: Computing optimal diameter-bounded polygon partitions

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