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:
- Publisher copy:
- Copyright date:
Random Hyperplane Search Trees.
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record