Random hyperplane search trees in high dimensions
<p>Given a set <em>S</em> of <em>n</em> ≥ <em>d</em> points in general position in <em>R<sup>d</sup></em>, a random hyperplane split is obtained by sampling <em>d</em> points uniformly at random without replacement from &l...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2015-06-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/67 |