Min/max Kd-tree
A min/max kd-tree is a k-d tree with two scalar values - a minimum and a maximum - assigned to its nodes. The minimum/maximum of an inner node is equal the minimum/maximum of its children's minima/maxima.
Read more about Min/max Kd-tree: Construction, Properties, Applications
Famous quotes containing the word max:
“What do any of us know of the private past of even the most harmless and kind-looking individuals?”
—Arnold Phillips, Max Nosseck (1902–1972)