CGAL Namespace Reference

Namespaces
	Euler

Classes
struct	CGALPointSetNNSearch

Functions
FEVV::CGALPointSetPointMap	get (const boost::vertex_point_t, FEVV::CGALPointSet &ps)
	Returns the points property map (aka the geometry) of the mesh. More...
FEVV::CGALPointSetPointMap	get (const boost::vertex_point_t, const FEVV::CGALPointSet &ps)
CGALPointSetNNSearch::KdTreePtr	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 > >	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 > >	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...
std::pair< typename boost::graph_traits< FEVV::CGALPointSet >::vertex_iterator, typename boost::graph_traits< FEVV::CGALPointSet >::vertex_iterator >	vertices (FEVV::CGALPointSet &ps)
	Returns the iterator range of the vertices of the mesh. More...
std::pair< FEVV::CGALPointSet::const_iterator, FEVV::CGALPointSet::const_iterator >	vertices (const FEVV::CGALPointSet &ps)
boost::graph_traits< FEVV::CGALPointSet >::vertices_size_type	num_vertices (const FEVV::CGALPointSet &ps)
	Returns an upper bound of the number of vertices of the mesh. More...
boost::graph_traits< FEVV::CGALPointSet >::vertex_descriptor	add_vertex (FEVV::CGALPointSet &ps)
	Adds a new vertex to the graph without initializing the connectivity. More...
void	remove_vertex (typename boost::graph_traits< FEVV::CGALPointSet >::vertex_descriptor v, FEVV::CGALPointSet &ps)
	Removes v from the mesh. More...

Function Documentation

add_vertex()

boost::graph_traits< FEVV::CGALPointSet >::vertex_descriptor CGAL::add_vertex ( FEVV::CGALPointSet &  ps )

inline

Adds a new vertex to the graph without initializing the connectivity.

Definition at line 120 of file Graph_traits_cgal_point_set.h.

create_kd_tree()

CGALPointSetNNSearch::KdTreePtr CGAL::create_kd_tree ( const FEVV::CGALPointSet &  pc )

inline

Initialize a k-d tree with all cloud points.

Definition at line 83 of file Graph_properties_cgal_point_set.h.

Here is the caller graph for this function:

get() [1/2]

FEVV::CGALPointSetPointMap CGAL::get ( const boost::vertex_point_t  , const FEVV::CGALPointSet &  ps  )

inline

Definition at line 53 of file Graph_properties_cgal_point_set.h.

get() [2/2]

FEVV::CGALPointSetPointMap CGAL::get ( const boost::vertex_point_t  , FEVV::CGALPointSet &  ps  )

inline

Returns the points property map (aka the geometry) of the mesh.

Definition at line 46 of file Graph_properties_cgal_point_set.h.

kNN_search()

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  )

inline

Search the k nearest neighbors of a geometric point.

Returns

A pair containing a vector of vertex descriptors (the ids of the k nearest neighbors) and a vector of distances (the distance to each nearest neighbor) ; both vectors have size k.

Definition at line 113 of file Graph_properties_cgal_point_set.h.

Here is the caller graph for this function:

num_vertices()

boost::graph_traits< FEVV::CGALPointSet >::vertices_size_type CGAL::num_vertices ( const FEVV::CGALPointSet &  ps )

inline

Returns an upper bound of the number of vertices of the mesh.

Definition at line 107 of file Graph_traits_cgal_point_set.h.

radius_search()

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  )

inline

Search for the nearest neighbors of a geometric point in the given radius.

Returns

A pair containing a vector of vertex descriptors (the ids of the nearest neighbors) and a vector of distances (the distance to each nearest neighbor) ; both vectors have the same size.

Definition at line 157 of file Graph_properties_cgal_point_set.h.

Here is the caller graph for this function:

remove_vertex()

void CGAL::remove_vertex ( typename boost::graph_traits< FEVV::CGALPointSet >::vertex_descriptor  v, FEVV::CGALPointSet &  ps  )

inline

Removes v from the mesh.

Definition at line 135 of file Graph_traits_cgal_point_set.h.

vertices() [1/2]

std::pair< FEVV::CGALPointSet::const_iterator, FEVV::CGALPointSet::const_iterator > CGAL::vertices ( const FEVV::CGALPointSet &  ps )

inline

Definition at line 95 of file Graph_traits_cgal_point_set.h.

vertices() [2/2]

std::pair< typename boost::graph_traits< FEVV::CGALPointSet >::vertex_iterator, typename boost::graph_traits< FEVV::CGALPointSet >::vertex_iterator > CGAL::vertices ( FEVV::CGALPointSet &  ps )

inline

Returns the iterator range of the vertices of the mesh.

Definition at line 87 of file Graph_traits_cgal_point_set.h.

Here is the caller graph for this function: