On rainbow quadrilaterals in colored point sets

DOI10.1007/s00373-022-02559-yOpenAlexW4293553583MaRDI QIDQ2676756

Yanyan Li

Publication date: 28 September 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-022-02559-y

zbMATH Keywords

colored point setsempty polygonsminimum-area polygonsrainbow polygons

Mathematics Subject Classification ID

Theory of computing (68Qxx) General convexity (52Axx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Monochromatic empty triangles in two-colored point sets
• Computing optimal islands
• On balanced 4-holes in bichromatic point sets
• Maximum-area triangle in a convex polygon, revisited
• Empty monochromatic triangles
• The power of geometric duality
• Visibility of disjoint polygons
• Topologically sweeping an arrangement
• Finding minimum area \(k\)-gons
• Finding minimum area simple pentagons
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• On a class of \(O(n^ 2)\) problems in computational geometry
• Empty rainbow triangles in \(k\)-colored point sets
• Rainbow polygons for colored point sets in the plane
• Empty monochromatic simplices
• On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
• Constructing Arrangements of Lines and Hyperplanes with Applications
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
• Visibility Algorithms in the Plane

This page was built for publication: On rainbow quadrilaterals in colored point sets