pcl Namespace Reference

Classes
struct	PCLPointCloudNNSearch

Functions
FEVV::PCLPointCloudPointMap	get (const boost::vertex_point_t, FEVV::PCLPointCloud &pc)
	Returns the points property map (aka the geometry) of the mesh. More...
FEVV::PCLPointCloudPointMap	get (const boost::vertex_point_t, const FEVV::PCLPointCloud &pc)
PCLPointCloudNNSearch::KdTreePtr	create_kd_tree (const FEVV::PCLPointCloud &pc)
	Initialize a k-d tree with all cloud points. More...
std::pair< std::vector< typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor >, std::vector< double > >	kNN_search (const PCLPointCloudNNSearch::KdTree &kd_tree, unsigned int k, const FEVV::PCLPoint &query, const FEVV::PCLPointCloud &)
	Search the k nearest neighbors of a geometric point. More...
std::pair< std::vector< typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor >, std::vector< double > >	radius_search (const PCLPointCloudNNSearch::KdTree &kd_tree, double radius, const FEVV::PCLPoint &query, const FEVV::PCLPointCloud &)
	Search for the nearest neighbors of a geometric point in the given radius. More...
std::pair< typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_iterator, typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_iterator >	vertices (const FEVV::PCLPointCloud &pc)
	Returns the iterator range of the vertices of the mesh. More...
boost::graph_traits< FEVV::PCLPointCloud >::vertices_size_type	num_vertices (const FEVV::PCLPointCloud &m)
	Returns an upper bound of the number of vertices of the mesh. More...
boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor	add_vertex (FEVV::PCLPointCloud &pc)
	Adds a new vertex to the graph without initializing the connectivity. More...
void	remove_vertex (typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor v, FEVV::PCLPointCloud &pc)
	Removes v from the mesh. More...

Function Documentation

add_vertex()

boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor pcl::add_vertex ( FEVV::PCLPointCloud &  pc )

inline

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

Definition at line 134 of file Graph_traits_pcl_point_cloud.h.

create_kd_tree()

PCLPointCloudNNSearch::KdTreePtr pcl::create_kd_tree ( const FEVV::PCLPointCloud &  pc )

inline

Initialize a k-d tree with all cloud points.

Definition at line 331 of file Graph_properties_pcl_point_cloud.h.

get() [1/2]

FEVV::PCLPointCloudPointMap pcl::get ( const boost::vertex_point_t  , const FEVV::PCLPointCloud &  pc  )

inline

Definition at line 102 of file Graph_properties_pcl_point_cloud.h.

get() [2/2]

FEVV::PCLPointCloudPointMap pcl::get ( const boost::vertex_point_t  , FEVV::PCLPointCloud &  pc  )

inline

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

Note

Must be in 'pcl' namespace because the real type of FEVV::PCLPointCloud is pcl::PointCloud<...> and the 'get(vertex_point,...)' must be in the same namespace as one of its parameters.

Definition at line 94 of file Graph_properties_pcl_point_cloud.h.

kNN_search()

std::pair< std::vector< typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor >, std::vector< double > > pcl::kNN_search ( const PCLPointCloudNNSearch::KdTree &  kd_tree, unsigned int  k, const FEVV::PCLPoint &  query, const FEVV::PCLPointCloud &    )

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 363 of file Graph_properties_pcl_point_cloud.h.

num_vertices()

boost::graph_traits< FEVV::PCLPointCloud >::vertices_size_type pcl::num_vertices ( const FEVV::PCLPointCloud &  m )

inline

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

Definition at line 119 of file Graph_traits_pcl_point_cloud.h.

Here is the call graph for this function:

radius_search()

std::pair< std::vector< typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor >, std::vector< double > > pcl::radius_search ( const PCLPointCloudNNSearch::KdTree &  kd_tree, double  radius, const FEVV::PCLPoint &  query, const FEVV::PCLPointCloud &    )

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 417 of file Graph_properties_pcl_point_cloud.h.

remove_vertex()

void pcl::remove_vertex ( typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_descriptor  v, FEVV::PCLPointCloud &  pc  )

inline

Removes v from the mesh.

Definition at line 150 of file Graph_traits_pcl_point_cloud.h.

vertices()

std::pair< typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_iterator, typename boost::graph_traits< FEVV::PCLPointCloud >::vertex_iterator > pcl::vertices ( const FEVV::PCLPointCloud &  pc )

inline

Returns the iterator range of the vertices of the mesh.

Definition at line 98 of file Graph_traits_pcl_point_cloud.h.

Here is the caller graph for this function: