Minimum convex partition of a constrained point set
From MaRDI portal
Publication:5929323
Recommendations
- Minimum convex partition of point sets
- A fixed parameter algorithm for optimal convex partitions
- Approximation Algorithms for the Minimum Convex Partition Problem
- Solving the minimum convex partition of point sets with integer programming
- Polynomial-time instances of the minimum weight triangulation problem
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Computational Geometry in C
- Computing the minimum weight triangulation of a set of linearly ordered points
- Decomposing a Polygon into Simpler Components
- Minimum convex partition of a constrained point set
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Polynomial-time instances of the minimum weight triangulation problem
Cited in
(15)- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- Minimum convex partitions of multidimensional polyhedrons
- A Convex Approach to Minimal Partitions
- Computing optimal islands
- A fixed parameter algorithm for optimal convex partitions
- Minimum Convex Partitions and Maximum Empty Polytopes
- Solving the minimum convex partition of point sets with integer programming
- Minimum weight convex Steiner partitions
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
- Minimum convex partition of a constrained point set
- Minimum convex partition of point sets
- Convex quadrangulations of bichromatic point sets
- Approximation Algorithms for the Minimum Convex Partition Problem
- Decomposing a simple polygon into pseudo-triangles and convex polygons
This page was built for publication: Minimum convex partition of a constrained point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929323)
