Decompositions, partitions, and coverings with convex polygons and pseudo-triangles

DOI10.1007/s00373-007-0752-xzbMath1131.05027OpenAlexW1547603158WikidataQ59782366 ScholiaQ59782366MaRDI QIDQ2464053

Csaba D. Tóth, Clemens Huemer, Bettina Speckmann, Sarah Kappes, Oswin Aichholzer

Publication date: 10 December 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.1726

zbMATH Keywords

partitionsdecompositionsplanar point setsRamsey-type results

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of tessellation and tiling problems (05B45) Ramsey theory (05D10) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (6)

Planar point sets with large minimum convex decompositions ⋮ On pseudo-convex partitions of a planar point set ⋮ On \(k\)-convex polygons ⋮ Decomposing a simple polygon into pseudo-triangles and convex polygons ⋮ On convex decompositions of a planar point set ⋮ Empty pseudo-triangles in point sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Konvexe Fünfecke in ebenen Punktmengen
• Ramsey-type results for geometric graphs. II
• Ray shooting in polygons using geodesic triangulations
• Ramsey-type results for geometric graphs. I
• Converting triangulations to quadrangulations
• Planar minimally rigid graphs and pseudo-triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• Enumerating order types for small point sets with applications
• A note on convex decompositions of a set of points in the plane
• Piecewise linear paths among convex obstacles
• On a partition into convex polygons
• Minimal tangent visibility graphs
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Decomposing a Polygon into Simpler Components
• A Ramsey-Type Result for Convex Sets
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Approximate convex decomposition of polygons
• Abstract order type extension and new results on the rectilinear crossing number
• Minimum convex partition of a constrained point set
• On the number of disjoint convex quadrilaterals for a planar point set

This page was built for publication: Decompositions, partitions, and coverings with convex polygons and pseudo-triangles