Alternating paths through disjoint line segments

DOI10.1016/S0020-0190(03)00349-1MaRDI QIDQ1014442zbMATH OpenOpenAlexFDO

Authors 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

computational geometryHamiltonian circuitline segmentvisibility graphs

Mathematics Subject Classification ID

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

Recommendations

• Alternating paths along axis-parallel segments
• Algorithms and Data Structures
• Discrete Lines and Wandering Paths
• Disjoint Paths in the Plane
• A long noncrossing path among disjoint segments in the plane
• scientific article; zbMATH DE number 3858436
• Long Alternating Paths Exist
• scientific article; zbMATH DE number 219253
• Rectilinear paths with minimum segment lengths
• scientific article; zbMATH DE number 1161303

Cites work

• Computing simple circuits from a set of line segments
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• scientific article; zbMATH DE number 2086212 (Why is no real title available?)
• On a counterexample to a conjecture of Mirzaian
• Segment endpoint visibility graphs are Hamiltonian

Cited in

(11)

• Encompassing colored planar straight line graphs
• Discrete Lines and Wandering Paths
• A long noncrossing path among disjoint segments in the plane
• Algorithms and Data Structures
• Crossing patterns of segments
• Long Alternating Paths Exist
• Flips in odd matchings
• Vertex-colored encompassing graphs
• Alternating paths along axis-parallel segments
• Compatible geometric matchings
• Augmenting the connectivity of geometric graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014442)