Imagine we have an N-dimensional space where each dimension can only have integer values. Imagine further that this space has a set of hypercubes scattered about, each hypercube with its own position and dimensions. How can we compile a decision tree, given a description of the hypercubes, that tells us, as quickly as possible, which hypercubes an arbitrary point lies inside? It sounds like solutions exist: could someone point me in the right direction?
$\begingroup$
$\endgroup$
1
-
1$\begingroup$ Techniques like this are well known in computational geometry, especially for convex sets; this is not a research question in mathematics. $\endgroup$– Ben McKayCommented Mar 14, 2018 at 10:14
Add a comment
|