scientific article; zbMATH DE number 1555917

zbMATH Open0953.68602MaRDI QIDQ4525680FDOQ4525680

Authors: Prosenjit Bose, Godfried Toussaint, Michael E. Houle 

Publication date: 24 January 2001

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (6)

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

This page was built for publication:

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