Pages that link to "Item:Q2824967"
From MaRDI portal
The following pages link to Problem of partitioning a planar point set into empty convex polygons (Q2824967):
Displaying 5 items.
- On pseudo-convex partitions of a planar point set (Q389454) (← links)
- The \(n\)-point and six-partite point of a convex polygon (Q1591894) (← links)
- Discrete and Computational Geometry (Q5897095) (← links)
- Disjoint empty convex polygons in planar point sets (Q5945676) (← links)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (Q6060047) (← links)
