Bounds for point recolouring in geometric graphs

DOI10.1016/j.comgeo.2009.01.004zbMath1180.05047OpenAlexW2112198514MaRDI QIDQ924089

David Rappaport, Yurai Núñez-Rodríguez, Henk G. Meijer

Publication date: 27 July 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.01.004

zbMATH Keywords

triangulationgeometric graphcomputational geometrypoint recolouringrecolouring scheme

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Mathematical geography and demography (91D20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Geometric Knapsack problems
• Delineating boundaries for imprecise regions
• Location of a Point in a Planar Subdivision and Its Applications
• Computational Geometry in C
• The complexity of computing minimum separating polygons

This page was built for publication: Bounds for point recolouring in geometric graphs