61 search results - page 1 / 13 » Pointed binary encompassing trees: Simple and optimal |
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
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...
SSPR
2004
Springer
13 years 10 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....