Every set of disjoint line segments admits a binary tree

DOI10.1007/3-540-58325-4_162MaRDI QIDQ4525680zbMATH OpenFDO

Authors Prosenjit Bose, Godfried Toussaint, Michael E. Houle

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_162

Mathematics Subject Classification ID

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

Recommendations

• Every set of disjoint line segments admits a binary tree
• Growing a Tree from Its Branches
• Pointed and colored binary encompassing trees
• Algorithm Theory - SWAT 2004
• Pointed binary encompassing trees: simple and optimal

Cited in

(6)

• Growing a Tree from Its Branches
• Algorithm Theory - SWAT 2004
• Pointed and colored binary encompassing trees
• THE MINIMUM GUARDING TREE PROBLEM
• Every set of disjoint line segments admits a binary tree
• Pointed binary encompassing trees: simple and optimal

This page was built for publication: Every set of disjoint line segments admits a binary tree

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