Details

Description

One important set of algorithm missing in geomtry is finding a ball enclosing a collection of points (finding the smallest ball would be even better).

One use case is to have a first extremely fast preliminary exclusion check before attempting to navigate through a complex BSP tree structure. As the BST tree are currently not optimized for fast rejection of outside points, it may be costly to use the full tree when the tree in fact covers a small part of the space and most points are outside of it. A single ball check of the enclosing ball would speed up computation.