Buckytree is an implicit data structure for O(NlogN) spatial sort and O(logN) spatial search of dimensional objects.
O(NlogN)
O(logN)
In other words, it’s an efficient way to sort and find objects based on the regions of space they occupy.
(Hat Tip: Anarchaia)
All fields are optional. Feedback is private by default; if it's okay for me to post your comment publically, be sure to say so.