cheshirekow
v0.1.0
|
classes implemeting a simplex tree for proximity queries More...
Classes | |
class | Geometry |
provides vertex storage for recursively building the "active" simplex during insertion More... | |
class | Node |
base class for nodes, implements storage and interface for the simplex tree More... | |
class | Simplex |
base class for nodes, implements storage and interface for the simplex tree More... | |
class | Tree |
base class for nodes, implements storage and interface for the simplex tree More... | |
classes implemeting a simplex tree for proximity queries
A simplex tree is like a quad tree. It's a recursive decomposition of a point set into those that lie inside a simplex. Each simplex is subdivided into NDim other simplices. The location of the split depends on the split policy