Almost empty monochromatic polygons in planar point sets

DOI10.1007/978-3-031-83438-7_5MaRDI QIDQ6969510zbMATH OpenFDO

Authors Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_5

zbMATH Keywords

colored point setsdiscrete geometryempty polygonsErdős-Szekeres theorem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A combinatorial problem in geometry.
• Almost empty monochromatic quadrilaterals in planar point sets
• Almost empty monochromatic triangles in planar point sets
• Almost empty polygons
• Characterizing and efficiently computing quadrangulations of planar point sets
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• Computer solution to the 17-point Erdős-Szekeres problem
• Empty convex hexagons in planar point sets
• Finding sets of points without empty convex 6-gons
• scientific article; zbMATH DE number 3649571 (Why is no real title available?)
• scientific article; zbMATH DE number 3168302 (Why is no real title available?)
• scientific article; zbMATH DE number 3354154 (Why is no real title available?)
• Konvexe Fünfecke in ebenen Punktmengen
• Large bichromatic point sets admit empty monochromatic 4-gons
• Matching edges and faces in polygonal partitions
• On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
• On empty hexagons
• On the Erdös-Szekeres problem
• On the Erdős-Szekeres convex polygon problem
• Sets with No Empty Convex 7-Gons
• The empty hexagon theorem
• Two extensions of the Erdős-Szekeres problem

This page was built for publication: Almost empty monochromatic polygons in planar point sets

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