The visibility graph of congruent discs is Hamiltonian

DOI10.1016/S0925-7721(02)00113-XzbMath1017.68091OpenAlexW1983952331MaRDI QIDQ1873692

David Rappaport

Publication date: 27 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00113-x

zbMATH Keywords

Computational geometryHamiltonian circuitvisibility graphVisibility graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
• A convex hull algorithm for discs, and applications
• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\)
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• Computing the width of a set
• Hamiltonian cycles in planar triangulations with no separating triangles
• Computational Geometry in C
• On the visibility graph of convex translates

This page was built for publication: The visibility graph of congruent discs is Hamiltonian