#include "FEVV/Wrappings/Graph_traits_cgal_point_set.h"
#include <CGAL/boost/graph/properties.h>
#include <CGAL/Search_traits_3.h>
#include <CGAL/Search_traits_adapter.h>
#include <CGAL/Orthogonal_k_neighbor_search.h>
#include <CGAL/Orthogonal_incremental_neighbor_search.h>
#include <CGAL/boost/iterator/counting_iterator.hpp>
#include <memory>
#include <utility>
Go to the source code of this file.
|
| FEVV |
| Interfaces for plugins These interfaces will be used for different plugins.
|
|
| CGAL |
|
| boost |
|
|
FEVV::CGALPointSetPointMap | CGAL::get (const boost::vertex_point_t, FEVV::CGALPointSet &ps) |
| Returns the points property map (aka the geometry) of the mesh. More...
|
|
FEVV::CGALPointSetPointMap | CGAL::get (const boost::vertex_point_t, const FEVV::CGALPointSet &ps) |
|
CGALPointSetNNSearch::KdTreePtr | CGAL::create_kd_tree (const FEVV::CGALPointSet &pc) |
| Initialize a k-d tree with all cloud points. More...
|
|
std::pair< std::vector< CGALPointSetNNSearch::vertex_descriptor >, std::vector< double > > | CGAL::kNN_search (const CGALPointSetNNSearch::KdTree &kd_tree, unsigned int k, const FEVV::CGALPointSetPoint &query, const FEVV::CGALPointSet &pc) |
| Search the k nearest neighbors of a geometric point. More...
|
|
std::pair< std::vector< CGALPointSetNNSearch::vertex_descriptor >, std::vector< double > > | CGAL::radius_search (const CGALPointSetNNSearch::KdTree &kd_tree, double radius, const FEVV::CGALPointSetPoint &query, const FEVV::CGALPointSet &pc) |
| Search for the nearest neighbors of a geometric point in the given radius. More...
|
|