Pages that link to "Item:Q5929323"
From MaRDI portal
The following pages link to Minimum convex partition of a constrained point set (Q5929323):
Displaying 13 items.
- Computing optimal islands (Q433119) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- Minimum convex partitions of multidimensional polyhedrons (Q1049732) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Minimum Convex Partitions and Maximum Empty Polytopes (Q2904557) (← links)
- A Convex Approach to Minimal Partitions (Q4902155) (← links)
- Convex Quadrangulations of Bichromatic Point Sets (Q5149559) (← links)
- Minimum convex partition of a constrained point set (Q5929323) (← links)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (Q6060047) (← links)
