Minimum convex partition of a constrained point set

DOI10.1016/S0166-218X(00)00237-7zbMath0977.52021WikidataQ127156009 ScholiaQ127156009MaRDI QIDQ5929323

Thomas Fevens, David Rappaport, Henk G. Meijer

Publication date: 14 June 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingminimum convex partitionpolynomial time algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Dynamic programming (90C39)

Related Items (8)

Solving the minimum convex partition of point sets with integer programming ⋮ Computing optimal islands ⋮ Decomposing a simple polygon into pseudo-triangles and convex polygons ⋮ Convex Quadrangulations of Bichromatic Point Sets ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Minimum convex partition of a constrained point set ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ A fixed parameter algorithm for optimal convex partitions

Cites Work

• Unnamed Item
• Computing the minimum weight triangulation of a set of linearly ordered points
• Polynomial-time instances of the minimum weight triangulation problem
• Decomposing a Polygon into Simpler Components
• Computational Geometry in C
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Minimum convex partition of a constrained point set

This page was built for publication: Minimum convex partition of a constrained point set