#include <vector>
#include <cassert>
#include <iostream>
#include <cstdint>
#include <limits>
#include <algorithm>
#include <cstring>
Go to the source code of this file.
Classes | |
struct | picoflann::KdTreeIndex< DIMS, Adapter, DistanceType >::Index |
class | picoflann::KdTreeIndex< DIMS, Adapter, DistanceType > |
struct | picoflann::L2 |
The KdTreeIndex class is the simplest an minimal method to use kdtrees. You only must define an adapter, that tells the class how to access the i-th dimension of your element. Here are two examples showing how easy it is: More... | |
struct | picoflann::KdTreeIndex< DIMS, Adapter, DistanceType >::Node |
class | picoflann::KdTreeIndex< DIMS, Adapter, DistanceType >::ResultSet |
Namespaces | |
picoflann | |