Two segment classes with Hamiltonian visibility graphs

DOI10.1016/0925-7721(94)90019-1zbMath0809.52005OpenAlexW2031282410WikidataQ127939630 ScholiaQ127939630MaRDI QIDQ1334612

Joseph O'Rourke, Jennifer Rippel

Publication date: 25 September 1994

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

Full work available at URL: https://doi.org/10.1016/0925-7721(94)90019-1

zbMATH Keywords

Hamiltonian circuitvisibility graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items

Alternating paths along axis-parallel segments ⋮ Circumscribing polygons and polygonizations for disjoint line segments ⋮ On circumscribing polygons for line segments ⋮ Segment endpoint visibility graphs are Hamiltonian ⋮ Disproving a conjecture on planar visibility graphs ⋮ Unnamed Item ⋮ A necessary condition for a graph to be the visibility graph of a simple polygon

Cites Work

• Unnamed Item
• Computing simple circuits from a set of line segments
• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• Good splitters for counting points in triangles