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 to the minimum/maximum of its children's minima/maxima.
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 to the minimum/maximum of its children's minima/maxima.
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 to the minimum/maximum of its children's minima/maxima.
Source: Wikipedia "Min/max kd-tree" · CC BY-SA 4.0
Share this article: X · Bluesky