Pages that link to "Item:Q367041"
From MaRDI portal
The following pages link to Planar point sets with large minimum convex decompositions (Q367041):
Displaying 10 items.
- Finite nondense point set analysis (Q686052) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- On convex decompositions of a planar point set (Q1024490) (← links)
- Decomposition of convex figures into similar pieces (Q1346133) (← links)
- A decompositin theorem for convexity spaces (Q1826114) (← links)
- A note on convex decompositions of a set of points in the plane (Q1889830) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms (Q4210143) (← links)
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets (Q5302743) (← links)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (Q6060047) (← links)
