Convex Quadrangulations of Bichromatic Point Sets

DOI10.1142/S0218195919500109zbMath1458.68269MaRDI QIDQ5149559

Alexander Pilz, Carlos Seara

Publication date: 11 February 2021

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

NP-completenessquadrangulationbichromatic point set

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Computing convex quadrangulations
• Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
• Converting triangulations to quadrangulations
• Characterizing and efficiently computing quadrangulations of planar point sets
• Small strictly convex quadrilateral meshes of point sets
• Bichromatic quadrangulations with Steiner points
• Colored Quadrangulations with Steiner Points
• On Convex Quadrangulations of Point Sets on the Plane
• Planar Formulae and Their Uses
• The Problem of Compatible Representatives
• Quadrangulations of planar sets
• REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS
• Minimum convex partition of a constrained point set

This page was built for publication: Convex Quadrangulations of Bichromatic Point Sets