| 88 | } |
| 89 | |
| 90 | size_t nearestNeighbour( const typename T::Point &p) |
| 91 | { |
| 92 | assert(m_tree); |
| 93 | |
| 94 | typename T::Iterator it = m_tree->nearestNeighbour(p); |
| 95 | |
| 96 | return std::distance( m_points->readable().begin(), it ); |
| 97 | } |
| 98 | |
| 99 | IntVectorDataPtr nearestNeighbours(const typename T::Point &p, typename T::Point::BaseType r) |
| 100 | { |
no test coverage detected