# A kd-tree algorithm to discover the boundary of a black box hypervolume or how to peel potatoes by recursively cutting them in halves

3 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Given a subset of $\R^\ndim$ of non-zero measure, defined through a blackbox function (an oracle), and assuming some regularity properties on this set, we build an efficient data structure representing this set. The naive approach would consists in sampling every point on a regular grid. As compared to it, our data structure has a complexity close to gaining one dimension both in terms of space and in number of calls to the oracle. This data structure produces a characteristic function (i.e. a function that can be used in lieu of the oracle), allows to measure the volume of the set, and allows to compute the distance to the boundary of the set for any point.
Keywords :
Document type :
Journal articles

Cited literature [10 references]

https://hal.archives-ouvertes.fr/hal-00816704
Contributor : Isabelle Alvarez Connect in order to contact the contributor
Submitted on : Monday, April 22, 2013 - 5:39:57 PM
Last modification on : Tuesday, November 16, 2021 - 4:03:43 AM
Long-term archiving on: : Tuesday, July 23, 2013 - 4:14:41 AM

### File

mainPotatoe.pdf
Files produced by the author(s)

### Citation

Jean-Baptiste Rouquier, Isabelle Alvarez, Romain Reuillon, Pierre-Henri Wuillemin. A kd-tree algorithm to discover the boundary of a black box hypervolume or how to peel potatoes by recursively cutting them in halves. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2015, 75 (3), pp.335-350. ⟨10.1007/s10472-015-9456-8⟩. ⟨hal-00816704⟩

Record views