The visibility graph of congruent discs is Hamiltonian

Authors:
David Rappaport
Affiliations:
School of Computing, Queen's University, Kingston, Ontario, K7L 3N6, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2003

Citing 10
Cited 0

Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing simple circuits from a set of line segments is NP-complete

SIAM Journal on Computing
Hamiltonian cycles in planar triangulations with no separating triangles

Journal of Graph Theory
A convex hull algorithm for discs, and applications

Computational Geometry: Theory and Applications
Hamiltonian triangulations and circumscribing polygons of disjoint line segments

Computational Geometry: Theory and Applications
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Visibility

Handbook of discrete and computational geometry
Computational geometry in C (2nd ed.)

Computational geometry in C (2nd ed.)
On the perfect matching of disjoint compact sets by noncrossing line segments in Rn

Discrete Applied Mathematics
On the visibility graph of convex translates

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit.