Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
DOI10.1007/S00373-007-0752-XzbMATH Open1131.05027OpenAlexW1547603158WikidataQ59782366 ScholiaQ59782366MaRDI QIDQ2464053FDOQ2464053
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
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
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)
Cites Work
- Ramsey-type results for geometric graphs. II
- Ramsey-type results for geometric graphs. I
- Title not available (Why is that?)
- Converting triangulations to quadrangulations
- Konvexe Fünfecke in ebenen Punktmengen
- On empty hexagons
- A Ramsey-Type Result for Convex Sets
- Title not available (Why is that?)
- On a partition into convex polygons
- On the number of disjoint convex quadrilaterals for a planar point set
- Planar minimally rigid graphs and pseudo-triangulations
- Enumerating order types for small point sets with applications
- Topologically sweeping visibility complexes via pseudotriangulations
- Title not available (Why is that?)
- Ray shooting in polygons using geodesic triangulations
- A note on convex decompositions of a set of points in the plane
- Minimum convex partition of a constrained point set
- Abstract order type extension and new results on the rectilinear crossing number
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Minimal tangent visibility graphs
- Deformable free space tilings for kinetic collision detection.
- Decomposing a Polygon into Simpler Components
- Title not available (Why is that?)
- Approximate convex decomposition of polygons
- Empty convex hexagons in planar point sets
- Piecewise linear paths among convex obstacles
Cited In (8)
- Title not available (Why is that?)
- 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
- Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
- Decomposing a simple polygon into pseudo-triangles and convex polygons
- 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)
