2006 | OriginalPaper | Buchkapitel
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
verfasst von : O. Aichholzer, C. Huemer, S. Kappes, B. Speckmann, C. D. Tóth
Erschienen in: Mathematical Foundations of Computer Science 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.