Tight Time Bounds for the Minimum Local Convex Partition Problem

DOI10.1007/11589440_10MaRDI QIDQ5449758zbMATH OpenOpenAlexFDO

Authors Magdalene Grantson, Christos Levcopoulos

Publication date 18 March 2008

Published in Discrete and Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11589440_10

Mathematics Subject Classification ID

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

Recommendations

• Approximation Algorithms for the Minimum Convex Partition Problem
• A fixed parameter algorithm for optimal convex partitions
• A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
• Minimum convex partition of point sets
• Algorithms for minimum length partitions of polygons

Cited in

(1)

• A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem

This page was built for publication: Tight Time Bounds for the Minimum Local Convex Partition Problem

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