A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves (Q905994)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves |
scientific article; zbMATH DE number 6536928
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves |
scientific article; zbMATH DE number 6536928 |
Statements
A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves (English)
0 references
28 January 2016
0 references
\(kd\)-tree
0 references
approximation of hyper-volume
0 references
viability
0 references
decision support system
0 references
