A Note on Convex Decompositions of a Set of Points in the Plane

Authors:
Víctor Neumann-Lara;Eduardo Rivera-Campo;Jorge Urrutia
Affiliations:
Universidad Nacional Autónoma de México, Ciudad Universitaria, Instituto de Matemáticas, México;Universidad Autónoma Metropolitana-Iztapalapa, Departamento de Matemáticas, México;Universidad Nacional Autónoma de México, Ciudad Universitaria, Instituto de Matemáticas, México
Venue:
Graphs and Combinatorics
Year:
2004

Citing 0
Cited 5

Minimum weight convex Steiner partitions

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On k-convex polygons

Computational Geometry: Theory and Applications
Approximation algorithms for the minimum convex partition problem

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Minimum convex partitions and maximum empty polytopes

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any set P of n points in general position in the plane there is a convex decomposition of P with at most * elements. Moreover, any minimal convex decomposition of such a set P has at most * elements, where k is the number of points in the boundary of the convex hull of P.