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

DOI10.1007/S00373-007-0752-XMaRDI QIDQ2464053zbMATH OpenOpenAlexWikidataFDO

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

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) Combinatorial aspects of tessellation and tiling problems (05B45) Ramsey theory (05D10) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
• Decomposition of Catalan numbers and convex polygon triangulations
• On partitions and \(k\)-polygons
• scientific article; zbMATH DE number 3998653
• On a partition into convex polygons
• Optimally decomposing coverings with translates of a convex polygon
• On nontrivial covers and partitions of graphs by convex sets
• scientific article; zbMATH DE number 851951
• scientific article; zbMATH DE number 3883609
• On simplicial partitions of polytopes

Cites work

• scientific article; zbMATH DE number 431988 (Why is no real title available?)
• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• scientific article; zbMATH DE number 2209713 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• A Ramsey-Type Result for Convex Sets
• A note on convex decompositions of a set of points in the plane
• Abstract order type extension and new results on the rectilinear crossing number
• Approximate convex decomposition of polygons
• Converting triangulations to quadrangulations
• Decomposing a Polygon into Simpler Components
• Deformable free space tilings for kinetic collision detection.
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Empty convex hexagons in planar point sets
• Enumerating order types for small point sets with applications
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• Konvexe Fünfecke in ebenen Punktmengen
• Minimal tangent visibility graphs
• Minimum convex partition of a constrained point set
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• On a partition into convex polygons
• On empty hexagons
• On the number of disjoint convex quadrilaterals for a planar point set
• Piecewise linear paths among convex obstacles
• Planar minimally rigid graphs and pseudo-triangulations
• Ramsey-type results for geometric graphs. I
• Ramsey-type results for geometric graphs. II
• Ray shooting in polygons using geodesic triangulations
• Topologically sweeping visibility complexes via pseudotriangulations

Cited in

(8)

• scientific article; zbMATH DE number 3998653 (Why is no real title available?)
• On convex decompositions of a planar point set
• On k-convex polygons
• Empty pseudo-triangles in point sets
• Planar point sets with large minimum convex decompositions
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
• On pseudo-convex partitions of a planar point set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464053)