Bounds for point recolouring in geometric graphs

Authors:
Henk Meijer;Yurai Núòez-Rodríguez;David Rappaport
Affiliations:
Roosevelt Academy, NL-4330 AB Middelburg, The Netherlands;School of Computing, Queen's University, Kingston, ON, K7L 3N6, Canada;School of Computing, Queen's University, Kingston, ON, K7L 3N6, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 5
Cited 1

The complexity of computing minimum separating polygons

Pattern Recognition Letters - Special issue on computational geometry
Computational Geometry in C

Computational Geometry in C
Low-Dimensional Linear Programming with Violations

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review

Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review
Delineating Boundaries for Imprecise Regions

Algorithmica

Fault recovery in wireless networks: the geometric recolouring approach

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine a recolouring scheme ostensibly used to assist in classifying geographic data. Given a drawing of a graph with bi-chromatic points, where the points are the vertices of the graph, a point can be recoloured if it is surrounded by neighbours of the opposite colour. The notion of surrounded is defined as a contiguous subset of neighbours that span an angle greater than 180 degrees. The recolouring of surrounded points continues in sequence, in no particular order, until no point remains surrounded. We show that for some classes of graphs the process terminates in a polynomial number of steps. On the other hand, there are classes of graphs with infinite recolouring sequences.