Covering the convex quadrilaterals of point sets

DOI10.1007/s00373-007-0717-0zbMath1118.52021OpenAlexW1967235411MaRDI QIDQ2373933

Jorge Urrutia, Toshinori Sakai

Publication date: 19 July 2007

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

Full work available at URL: https://doi.org/10.1007/s00373-007-0717-0

zbMATH Keywords

CoveringBicolored point set

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (8)

Two disjoint 5-holes in point sets ⋮ Carathéodory's theorem in depth ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ Witness (Delaunay) graphs ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ Witness rectangle graphs ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ STABBING SIMPLICES OF POINT SETS WITH k-FLATS

Cites Work

• Unnamed Item
• Unnamed Item
• On empty triangles determined by points in the plane
• Regelmäßige Vielecke und ihre Diagonalen
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.

This page was built for publication: Covering the convex quadrilaterals of point sets