On the number of disjoint convex quadrilaterals for a planar point set

DOI10.1016/S0925-7721(01)00023-2zbMath0990.68171OpenAlexW2152525037MaRDI QIDQ5952583

Masatsugu Urabe, Kiyoshi Hosono

Publication date: 14 August 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00023-2

zbMATH Keywords

discrete geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (16)

Two disjoint 5-holes in point sets ⋮ A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ On pseudo-convex partitions of a planar point set ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ A Bound on a Convexity Measure for Point Sets ⋮ Cells in any simple polygon formed by a planar point set ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ A note on the value in the disjoint convex partition problem ⋮ Disjoint empty convex pentagons in planar point sets ⋮ On the number of empty convex quadrilaterals of a finite set in the plane ⋮ On the minimum size of a point set containing a 5-hole and double disjoint 3-holes ⋮ New proofs about the number of empty convex 4-gons and 5-gons in a planar point set ⋮ A note on the upper bound for disjoint convex partitions ⋮ The Erdos-Szekeres problem on points in convex position – a survey

Cites Work

• Konvexe Fünfecke in ebenen Punktmengen
• On a partition into convex polygons
• Sets with No Empty Convex 7-Gons
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of disjoint convex quadrilaterals for a planar point set