On polygons enclosing point sets. II

DOI10.1007/s00373-009-0848-6zbMath1182.52003OpenAlexW2012305609MaRDI QIDQ1043822

Ferran Hurtado, Jorge Urrutia, Inmaculada Ventura, Toshinori Sakai, Criel Merino, Deborah Oliveros

Publication date: 9 December 2009

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

Full work available at URL: http://hdl.handle.net/2117/9618

zbMATH Keywords

convex hullenclosing polygonpartitioning lemmared blue point sets

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (2)

On polygons excluding point sets ⋮ Discrete geometry on colored point sets in the plane -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On empty triangles determined by points in the plane
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• On simple polygonalizations with optimal area
• Research Problems in Discrete Geometry
• On the number of crossing-free matchings, (cycles, and partitions)
• Crossing-Free Subgraphs
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)

This page was built for publication: On polygons enclosing point sets. II