Point Cloud Library (PCL)  1.8.1-dev
List of all members | Classes | Public Types | Public Member Functions | Protected Attributes
pcl::GreedyProjectionTriangulation< PointInT > Class Template Reference

GreedyProjectionTriangulation is an implementation of a greedy triangulation algorithm for 3D points based on local 2D projections. More...

#include <pcl/surface/gp3.h>

+ Inheritance diagram for pcl::GreedyProjectionTriangulation< PointInT >:

Public Types

enum  GP3Type {
  NONE = -1, FREE = 0, FRINGE = 1, BOUNDARY = 2,
  COMPLETED = 3
}
 
typedef boost::shared_ptr
< GreedyProjectionTriangulation
< PointInT > > 
Ptr
 
typedef boost::shared_ptr
< const
GreedyProjectionTriangulation
< PointInT > > 
ConstPtr
 
typedef pcl::KdTree< PointInT > KdTree
 
typedef pcl::KdTree< PointInT >
::Ptr 
KdTreePtr
 
typedef pcl::PointCloud< PointInT > PointCloudIn
 
typedef PointCloudIn::Ptr PointCloudInPtr
 
typedef PointCloudIn::ConstPtr PointCloudInConstPtr
 
- Public Types inherited from pcl::MeshConstruction< PointInT >
typedef boost::shared_ptr
< MeshConstruction< PointInT > > 
Ptr
 
typedef boost::shared_ptr
< const MeshConstruction
< PointInT > > 
ConstPtr
 
- Public Types inherited from pcl::PCLSurfaceBase< PointInT >
typedef boost::shared_ptr
< PCLSurfaceBase< PointInT > > 
Ptr
 
typedef boost::shared_ptr
< const PCLSurfaceBase
< PointInT > > 
ConstPtr
 
typedef pcl::search::Search
< PointInT > 
KdTree
 
typedef pcl::search::Search
< PointInT >::Ptr 
KdTreePtr
 
- Public Types inherited from pcl::PCLBase< PointInT >
typedef pcl::PointCloud< PointInT > PointCloud
 
typedef PointCloud::Ptr PointCloudPtr
 
typedef PointCloud::ConstPtr PointCloudConstPtr
 
typedef boost::shared_ptr
< PointIndices
PointIndicesPtr
 
typedef boost::shared_ptr
< PointIndices const > 
PointIndicesConstPtr
 

Public Member Functions

 GreedyProjectionTriangulation ()
 Empty constructor. More...
 
void setMu (double mu)
 Set the multiplier of the nearest neighbor distance to obtain the final search radius for each point (this will make the algorithm adapt to different point densities in the cloud). More...
 
double getMu () const
 Get the nearest neighbor distance multiplier. More...
 
void setMaximumNearestNeighbors (int nnn)
 Set the maximum number of nearest neighbors to be searched for. More...
 
int getMaximumNearestNeighbors () const
 Get the maximum number of nearest neighbors to be searched for. More...
 
void setSearchRadius (double radius)
 Set the sphere radius that is to be used for determining the k-nearest neighbors used for triangulating. More...
 
double getSearchRadius () const
 Get the sphere radius used for determining the k-nearest neighbors. More...
 
void setMinimumAngle (double minimum_angle)
 Set the minimum angle each triangle should have. More...
 
double getMinimumAngle () const
 Get the parameter for distance based weighting of neighbors. More...
 
void setMaximumAngle (double maximum_angle)
 Set the maximum angle each triangle can have. More...
 
double getMaximumAngle () const
 Get the parameter for distance based weighting of neighbors. More...
 
void setMaximumSurfaceAngle (double eps_angle)
 Don't consider points for triangulation if their normal deviates more than this value from the query point's normal. More...
 
double getMaximumSurfaceAngle () const
 Get the maximum surface angle. More...
 
void setNormalConsistency (bool consistent)
 Set the flag if the input normals are oriented consistently. More...
 
bool getNormalConsistency () const
 Get the flag for consistently oriented normals. More...
 
void setConsistentVertexOrdering (bool consistent_ordering)
 Set the flag to order the resulting triangle vertices consistently (positive direction around normal). More...
 
bool getConsistentVertexOrdering () const
 Get the flag signaling consistently ordered triangle vertices. More...
 
std::vector< int > getPointStates () const
 Get the state of each point after reconstruction. More...
 
std::vector< int > getPartIDs () const
 Get the ID of each point after reconstruction. More...
 
std::vector< int > getSFN () const
 Get the sfn list. More...
 
std::vector< int > getFFN () const
 Get the ffn list. More...
 
- Public Member Functions inherited from pcl::MeshConstruction< PointInT >
 MeshConstruction ()
 Constructor. More...
 
virtual ~MeshConstruction ()
 Destructor. More...
 
virtual void reconstruct (pcl::PolygonMesh &output)
 Base method for surface reconstruction for all points given in <setInputCloud (), setIndices ()> More...
 
virtual void reconstruct (std::vector< pcl::Vertices > &polygons)
 Base method for mesh construction for all points given in <setInputCloud (), setIndices ()> More...
 
- Public Member Functions inherited from pcl::PCLSurfaceBase< PointInT >
 PCLSurfaceBase ()
 Empty constructor. More...
 
virtual ~PCLSurfaceBase ()
 Empty destructor. More...
 
void setSearchMethod (const KdTreePtr &tree)
 Provide an optional pointer to a search object. More...
 
KdTreePtr getSearchMethod ()
 Get a pointer to the search method used. More...
 
- Public Member Functions inherited from pcl::PCLBase< PointInT >
 PCLBase ()
 Empty constructor. More...
 
 PCLBase (const PCLBase &base)
 Copy constructor. More...
 
virtual ~PCLBase ()
 Destructor. More...
 
virtual void setInputCloud (const PointCloudConstPtr &cloud)
 Provide a pointer to the input dataset. More...
 
PointCloudConstPtr const getInputCloud () const
 Get a pointer to the input point cloud dataset. More...
 
virtual void setIndices (const IndicesPtr &indices)
 Provide a pointer to the vector of indices that represents the input data. More...
 
virtual void setIndices (const IndicesConstPtr &indices)
 Provide a pointer to the vector of indices that represents the input data. More...
 
virtual void setIndices (const PointIndicesConstPtr &indices)
 Provide a pointer to the vector of indices that represents the input data. More...
 
virtual void setIndices (size_t row_start, size_t col_start, size_t nb_rows, size_t nb_cols)
 Set the indices for the points laying within an interest region of the point cloud. More...
 
IndicesPtr const getIndices ()
 Get a pointer to the vector of indices used. More...
 
IndicesConstPtr const getIndices () const
 Get a pointer to the vector of indices used. More...
 
const PointInT & operator[] (size_t pos) const
 Override PointCloud operator[] to shorten code. More...
 

Protected Attributes

double mu_
 The nearest neighbor distance multiplier to obtain the final search radius. More...
 
double search_radius_
 The nearest neighbors search radius for each point and the maximum edge length. More...
 
int nnn_
 The maximum number of nearest neighbors accepted by searching. More...
 
double minimum_angle_
 The preferred minimum angle for the triangles. More...
 
double maximum_angle_
 The maximum angle for the triangles. More...
 
double eps_angle_
 Maximum surface angle. More...
 
bool consistent_
 Set this to true if the normals of the input are consistently oriented. More...
 
bool consistent_ordering_
 Set this to true if the output triangle vertices should be consistently oriented. More...
 
- Protected Attributes inherited from pcl::MeshConstruction< PointInT >
bool check_tree_
 A flag specifying whether or not the derived reconstruction algorithm needs the search object tree. More...
 
- Protected Attributes inherited from pcl::PCLSurfaceBase< PointInT >
KdTreePtr tree_
 A pointer to the spatial search object. More...
 
- Protected Attributes inherited from pcl::PCLBase< PointInT >
PointCloudConstPtr input_
 The input point cloud dataset. More...
 
IndicesPtr indices_
 A pointer to the vector of point indices to use. More...
 
bool use_indices_
 Set to true if point indices are used. More...
 
bool fake_indices_
 If no set of indices are given, we construct a set of fake indices that mimic the input PointCloud. More...
 

Additional Inherited Members

- Protected Member Functions inherited from pcl::PCLBase< PointInT >
bool initCompute ()
 This method should get called before starting the actual computation. More...
 
bool deinitCompute ()
 This method should get called after finishing the actual computation. More...
 

Detailed Description

template<typename PointInT>
class pcl::GreedyProjectionTriangulation< PointInT >

GreedyProjectionTriangulation is an implementation of a greedy triangulation algorithm for 3D points based on local 2D projections.

It assumes locally smooth surfaces and relatively smooth transitions between areas with different point densities.

Author
Zoltan Csaba Marton

Definition at line 138 of file gp3.h.

Member Typedef Documentation

template<typename PointInT>
typedef boost::shared_ptr<const GreedyProjectionTriangulation<PointInT> > pcl::GreedyProjectionTriangulation< PointInT >::ConstPtr

Definition at line 142 of file gp3.h.

template<typename PointInT>
typedef pcl::KdTree<PointInT> pcl::GreedyProjectionTriangulation< PointInT >::KdTree

Definition at line 148 of file gp3.h.

template<typename PointInT>
typedef pcl::KdTree<PointInT>::Ptr pcl::GreedyProjectionTriangulation< PointInT >::KdTreePtr

Definition at line 149 of file gp3.h.

template<typename PointInT>
typedef pcl::PointCloud<PointInT> pcl::GreedyProjectionTriangulation< PointInT >::PointCloudIn

Definition at line 151 of file gp3.h.

template<typename PointInT>
typedef PointCloudIn::ConstPtr pcl::GreedyProjectionTriangulation< PointInT >::PointCloudInConstPtr

Definition at line 153 of file gp3.h.

template<typename PointInT>
typedef PointCloudIn::Ptr pcl::GreedyProjectionTriangulation< PointInT >::PointCloudInPtr

Definition at line 152 of file gp3.h.

template<typename PointInT>
typedef boost::shared_ptr<GreedyProjectionTriangulation<PointInT> > pcl::GreedyProjectionTriangulation< PointInT >::Ptr

Definition at line 141 of file gp3.h.

Member Enumeration Documentation

template<typename PointInT>
enum pcl::GreedyProjectionTriangulation::GP3Type
Enumerator
NONE 
FREE 
FRINGE 
BOUNDARY 
COMPLETED 

Definition at line 155 of file gp3.h.

Constructor & Destructor Documentation

template<typename PointInT>
pcl::GreedyProjectionTriangulation< PointInT >::GreedyProjectionTriangulation ( )
inline

Empty constructor.

Definition at line 165 of file gp3.h.

Member Function Documentation

template<typename PointInT>
bool pcl::GreedyProjectionTriangulation< PointInT >::getConsistentVertexOrdering ( ) const
inline

Get the flag signaling consistently ordered triangle vertices.

Definition at line 289 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::consistent_ordering_.

template<typename PointInT>
std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getFFN ( ) const
inline

Get the ffn list.

Definition at line 310 of file gp3.h.

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::getMaximumAngle ( ) const
inline

Get the parameter for distance based weighting of neighbors.

Definition at line 256 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::maximum_angle_.

template<typename PointInT>
int pcl::GreedyProjectionTriangulation< PointInT >::getMaximumNearestNeighbors ( ) const
inline

Get the maximum number of nearest neighbors to be searched for.

Definition at line 223 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::nnn_.

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::getMaximumSurfaceAngle ( ) const
inline

Get the maximum surface angle.

Definition at line 268 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::eps_angle_.

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::getMinimumAngle ( ) const
inline

Get the parameter for distance based weighting of neighbors.

Definition at line 245 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::minimum_angle_.

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::getMu ( ) const
inline

Get the nearest neighbor distance multiplier.

Definition at line 213 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::mu_.

template<typename PointInT>
bool pcl::GreedyProjectionTriangulation< PointInT >::getNormalConsistency ( ) const
inline

Get the flag for consistently oriented normals.

Definition at line 278 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::consistent_.

template<typename PointInT>
std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getPartIDs ( ) const
inline

Get the ID of each point after reconstruction.

Note
parts are numbered from 0, a -1 denotes unconnected points

Definition at line 301 of file gp3.h.

template<typename PointInT>
std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getPointStates ( ) const
inline

Get the state of each point after reconstruction.

Note
Options are defined as constants: FREE, FRINGE, COMPLETED, BOUNDARY and NONE

Definition at line 295 of file gp3.h.

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::getSearchRadius ( ) const
inline

Get the sphere radius used for determining the k-nearest neighbors.

Definition at line 234 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::search_radius_.

template<typename PointInT>
std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getSFN ( ) const
inline

Get the sfn list.

Definition at line 306 of file gp3.h.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setConsistentVertexOrdering ( bool  consistent_ordering)
inline

Set the flag to order the resulting triangle vertices consistently (positive direction around normal).

Note
Assumes consistently oriented normals (towards the viewpoint) – see setNormalConsistency ()
Parameters
[in]consistent_orderingset it to true if triangle vertices should be ordered consistently

Definition at line 285 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::consistent_ordering_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setMaximumAngle ( double  maximum_angle)
inline

Set the maximum angle each triangle can have.

Parameters
[in]maximum_anglethe maximum angle each triangle can have
Note
For best results, its value should be around 120 degrees

Definition at line 252 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::maximum_angle_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setMaximumNearestNeighbors ( int  nnn)
inline

Set the maximum number of nearest neighbors to be searched for.

Parameters
[in]nnnthe maximum number of nearest neighbors

Definition at line 219 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::nnn_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setMaximumSurfaceAngle ( double  eps_angle)
inline

Don't consider points for triangulation if their normal deviates more than this value from the query point's normal.

Parameters
[in]eps_anglemaximum surface angle
Note
As normal estimation methods usually give smooth transitions at sharp edges, this ensures correct triangulation by avoiding connecting points from one side to points from the other through forcing the use of the edge points.

Definition at line 264 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::eps_angle_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setMinimumAngle ( double  minimum_angle)
inline

Set the minimum angle each triangle should have.

Parameters
[in]minimum_anglethe minimum angle each triangle should have
Note
As this is a greedy approach, this will have to be violated from time to time

Definition at line 241 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::minimum_angle_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setMu ( double  mu)
inline

Set the multiplier of the nearest neighbor distance to obtain the final search radius for each point (this will make the algorithm adapt to different point densities in the cloud).

Parameters
[in]muthe multiplier

Definition at line 209 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::mu_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setNormalConsistency ( bool  consistent)
inline

Set the flag if the input normals are oriented consistently.

Parameters
[in]consistentset it to true if the normals are consistently oriented

Definition at line 274 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::consistent_.

template<typename PointInT>
void pcl::GreedyProjectionTriangulation< PointInT >::setSearchRadius ( double  radius)
inline

Set the sphere radius that is to be used for determining the k-nearest neighbors used for triangulating.

Parameters
[in]radiusthe sphere radius that is to contain all k-nearest neighbors
Note
This distance limits the maximum edge length!

Definition at line 230 of file gp3.h.

References pcl::GreedyProjectionTriangulation< PointInT >::search_radius_.

Member Data Documentation

template<typename PointInT>
bool pcl::GreedyProjectionTriangulation< PointInT >::consistent_
protected

Set this to true if the normals of the input are consistently oriented.

Definition at line 332 of file gp3.h.

Referenced by pcl::GreedyProjectionTriangulation< PointInT >::getNormalConsistency(), and pcl::GreedyProjectionTriangulation< PointInT >::setNormalConsistency().

template<typename PointInT>
bool pcl::GreedyProjectionTriangulation< PointInT >::consistent_ordering_
protected

Set this to true if the output triangle vertices should be consistently oriented.

Definition at line 335 of file gp3.h.

Referenced by pcl::GreedyProjectionTriangulation< PointInT >::getConsistentVertexOrdering(), and pcl::GreedyProjectionTriangulation< PointInT >::setConsistentVertexOrdering().

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::eps_angle_
protected
template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::maximum_angle_
protected
template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::minimum_angle_
protected

The preferred minimum angle for the triangles.

Definition at line 323 of file gp3.h.

Referenced by pcl::GreedyProjectionTriangulation< PointInT >::getMinimumAngle(), and pcl::GreedyProjectionTriangulation< PointInT >::setMinimumAngle().

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::mu_
protected

The nearest neighbor distance multiplier to obtain the final search radius.

Definition at line 314 of file gp3.h.

Referenced by pcl::GreedyProjectionTriangulation< PointInT >::getMu(), and pcl::GreedyProjectionTriangulation< PointInT >::setMu().

template<typename PointInT>
int pcl::GreedyProjectionTriangulation< PointInT >::nnn_
protected

The maximum number of nearest neighbors accepted by searching.

Definition at line 320 of file gp3.h.

Referenced by pcl::GreedyProjectionTriangulation< PointInT >::getMaximumNearestNeighbors(), and pcl::GreedyProjectionTriangulation< PointInT >::setMaximumNearestNeighbors().

template<typename PointInT>
double pcl::GreedyProjectionTriangulation< PointInT >::search_radius_
protected

The nearest neighbors search radius for each point and the maximum edge length.

Definition at line 317 of file gp3.h.

Referenced by pcl::GreedyProjectionTriangulation< PointInT >::getSearchRadius(), and pcl::GreedyProjectionTriangulation< PointInT >::setSearchRadius().


The documentation for this class was generated from the following files: