On rainbow quadrilaterals in colored point sets

DOI10.1007/S00373-022-02559-YMaRDI QIDQ2676756zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(2)

• On rainbow isosceles \(n\)-simplexes
• An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets

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

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