Journal article icon

Journal article

Random Hyperplane Search Trees.

Abstract:

A hyperplane search tree is a binary tree used to store a set S of n d-dimensional data points. In a random hyperplane search tree for S, the root represents a hyperplane defined by d data points drawn uniformly at random from S. The remaining data points are split by the hyperplane, and the definition is used recursively on each subset. We assume that the data are points in general position in Rd. We show that, uniformly over all such data sets S, the expected height of the hyperplane tree i...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1137/060678609

Authors


Journal:
SIAM J. Comput.
Volume:
38
Issue:
6
Pages:
2411-2425
Publication date:
2009-01-01
DOI:
EISSN:
1095-7111
ISSN:
0097-5397
URN:
uuid:84d36457-1e66-4506-8ebd-20d9de511464
Source identifiers:
102284
Local pid:
pubs:102284

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP