Sets in R d with no large empty convex subsets
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
On a partition into convex polygons
Discrete Applied Mathematics
On a matching problem in the plane
Discrete Mathematics
Minimum convex partition of a constrained point set
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Matching colored points in the plane: some new results
Computational Geometry: Theory and Applications
On the number of disjoint convex quadrilaterals for a planar point set
Computational Geometry: Theory and Applications
Discrete & Computational Geometry
Empty Convex Hexagons in Planar Point Sets
Discrete & Computational Geometry
A fixed parameter algorithm for optimal convex partitions
Journal of Discrete Algorithms
Piercing quasi-rectangles: on a problem of Danzer and Rogers
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximation algorithms for the minimum convex partition problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A fixed parameter algorithm for the minimum number convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Minimum convex partitions and maximum empty polytopes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
This column is devoted to partitions of point-sets into convex subsets with interior-disjoint convex hulls. We review some partitioning problems and corresponding algorithms. At the end we list some open problems. For simplicity, in most cases we remain at the lowest possible interesting level, that is, in the plane.