Minimum convex partition of point sets
From MaRDI portal
Recommendations
Cited in
(16)- Minimum convex partitions of multidimensional polyhedrons
- Minimum Convex Partitions and Maximum Empty Polytopes
- Minimum convex partitions and maximum empty polytopes
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- scientific article; zbMATH DE number 867650 (Why is no real title available?)
- A Convex Approach to Minimal Partitions
- Tight Time Bounds for the Minimum Local Convex Partition Problem
- Minimum weight convex Steiner partitions
- Approximation Algorithms for the Minimum Convex Partition Problem
- Minimum convex partition of a constrained point set
- Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)
- Computing low-cost convex partitions for planar point sets based on tailored decompositions (CG challenge)
- Hardness and approximation of minimum convex partition
- An integer programming formulation using convex polygons for the convex partition problem
- Solving the minimum convex partition of point sets with integer programming
- Minimum k-partitioning of rectilinear polygons
This page was built for publication: Minimum convex partition of point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294038)