A kd-tree algorithm to discover the boundary of a black box hypervolume or how to peel potatoes by recursively cutting them in halves - Archive ouverte HAL Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2015

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

Jean-Baptiste Rouquier
  • Function : Author
  • PersonId : 835623
Pierre-Henri Wuillemin

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.
Fichier principal
Vignette du fichier
mainPotatoe.pdf (572.05 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00816704 , version 1 (22-04-2013)

Identifiers

Cite

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, 2015, 75 (3), pp.335-350. ⟨10.1007/s10472-015-9456-8⟩. ⟨hal-00816704⟩
649 View
843 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More