On a counterexample to a conjecture of Mirzaian

DOI10.1016/0925-7721(92)90020-SzbMath0761.52006OpenAlexW2031165997WikidataQ123293812 ScholiaQ123293812MaRDI QIDQ1200912

Masatsugu Urabe, Mamoru Watanabe

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0925-7721(92)90020-s

zbMATH Keywords

\(n\) disjoint line segments in the planecircumscribing polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (9)

Reconstruction of Weakly Simple Polygons from Their Edges ⋮ Topics on line segments and polygons ⋮ Circumscribing polygons and polygonizations for disjoint line segments ⋮ On circumscribing polygons for line segments ⋮ Segment endpoint visibility graphs are Hamiltonian ⋮ Compatible spanning trees ⋮ Compatible geometric matchings ⋮ Unnamed Item ⋮ Alternating paths through disjoint line segments

Cites Work

• Computing simple circuits from a set of line segments
• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• Computing Simple Circuits from a Set of Line Segments is NP-Complete

This page was built for publication: On a counterexample to a conjecture of Mirzaian