Implementation of partition trees? Have partition trees ever been implemented?

Here, I'm talking about the partition trees from computational geometry.  The earliest (near-)optimal versions of which were due to Matousek and others, and most recently Timothy Chan:

https://cs.uwaterloo.ca/~tmchan/optpt_2_10.pdf

It sounds crazy to me that these have never been implemented, but googling turned up no implementations that anyone has ever reported on.
By the definition in the linked paper on page 5, the statement is wrong. Binary space partition (BSP) trees have been used for decades on computer graphics to speed up spatial queries, as have quadtrees and octrees. K-d trees are used extensively in machine learning to speed up nearest-neighbor searches. If you squint just a little, decision trees also fit the general definition.