Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

SWAT
2004
Springer

favoriteEmaildiscussreport

108views Algorithms» more SWAT 2004»

Pointed Binary Encompassing Trees

14 years 4 months ago

Pointed Binary Encompassing Trees

Download cgw2004.csail.mit.edu

For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges lie in a halfplane deﬁned by the incident input segment. Our algorithm runs in O(n log n) time which is known to be optimal in the algebraic computation tree model.

Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa

Real-time Traffic

Algorithms | Binary Encompassing Tree | Disjoint Line Segments | Incident Input Segment | SWAT 2004 |

claim paper

Related Content

» Pointed binary encompassing trees Simple and optimal

» The total path length of split trees

» Universal Limit Laws for Depths in Random Trees

» Binary Orientation Trees for Volume and Surface Reconstruction from Unoriented Point Cloud...

» On the formal points of the formal topology of the binary tree

» Framework design using function generalization a binary tree traversal case study

» A Tight Lower Bound for the Steiner Point Removal Problem on Trees

» Financial Time Series Segmentation based on Specialized Binary Tree Representation

» Binary Tree Encryption Constructions and Applications

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SWAT
Authors	Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth

Comments (0)