Minor Description
Polygon2D.create recursively sorts on each dimension to build a tree. However, it does not really need to sort the data, it just needs to compute the median and partition other values around it, which can be performed in O
. If I am not mistaken, this would make Polygon2D.create run in O(n log) rather than O(n log^2) today.