Every set of disjoint line segments admits a binary tree

DOI10.1007/s00454-001-0042-yzbMath0988.68140OpenAlexW2057259762MaRDI QIDQ5953078

Patrick Bosc, Michael E. Houle, Godfried T. Toussaint

Publication date: 22 July 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0042-y

zbMATH Keywords

treeline segments

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Convex Partitions with 2-Edge Connected Dual Graphs ⋮ Alternating paths along axis-parallel segments ⋮ Segment endpoint visibility graphs are Hamiltonian ⋮ Disjoint compatible geometric matchings ⋮ Compatible spanning trees ⋮ Compatible geometric matchings ⋮ Convex partitions with 2-edge connected dual graphs ⋮ Augmenting the connectivity of geometric graphs ⋮ Encompassing colored planar straight line graphs ⋮ Disjoint compatibility graph of non-crossing matchings of points in convex position ⋮ Pointed binary encompassing trees: simple and optimal ⋮ Vertex-colored encompassing graphs ⋮ A vertex-face assignment for plane graphs