On a partition into convex polygons
Discrete Applied Mathematics
Handbook of discrete and computational geometry
Converting triangulations to quadrangulations
Computational Geometry: Theory and Applications
Minimum convex partition of a constrained point set
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
Proceedings of the eighteenth annual symposium on Computational geometry
On the number of disjoint convex quadrilaterals for a planar point set
Computational Geometry: Theory and Applications
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximate convex decomposition of polygons
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A Note on Convex Decompositions of a Set of Points in the Plane
Graphs and Combinatorics
Abstract order type extension and new results on the rectilinear crossing number
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
| Hi-index | 0.00 |
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results concerning disjoint empty convex k-gons in point sets.