Alternating paths through disjoint line segments

DOI10.1016/S0020-0190(03)00349-1zbMath1161.68818OpenAlexW2038972080MaRDI QIDQ1014442

J. Martínez

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00349-1

zbMATH Keywords

Hamiltonian circuitcomputational geometryline segmentvisibility graphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Alternating paths along axis-parallel segments ⋮ Compatible geometric matchings ⋮ Augmenting the connectivity of geometric graphs ⋮ Encompassing colored planar straight line graphs ⋮ Vertex-colored encompassing graphs

Cites Work

• Computing simple circuits from a set of line segments
• On a counterexample to a conjecture of Mirzaian
• Segment endpoint visibility graphs are Hamiltonian
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• Unnamed Item

This page was built for publication: Alternating paths through disjoint line segments