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. More...

#include <gp3.h>

Inheritance diagram for pcl::GreedyProjectionTriangulation< PointInT >:

[legend]

List of all members.

Classes
struct	doubleEdge
	Struct for storing the edges starting from a fringe point. More...
struct	nnAngle
	Struct for storing the angles to nearest neighbors. More...
Public Types
enum	{ NONE = -1, FREE = 0, FRINGE = 1, BOUNDARY = 2, COMPLETED = 3 }
typedef pcl::KdTree< PointInT >	KdTree
typedef pcl::KdTree< PointInT > ::Ptr	KdTreePtr
typedef pcl::PointCloud< PointInT >	PointCloudIn
typedef PointCloudIn::ConstPtr	PointCloudInConstPtr
typedef PointCloudIn::Ptr	PointCloudInPtr
Public Member Functions
bool	getConsistentVertexOrdering ()
	Get the flag signaling consistently ordered triangle vertices.
std::vector< int >	getFFN ()
	Get the ffn list.
double	getMaximumAngle ()
	Get the parameter for distance based weighting of neighbors.
int	getMaximumNearestNeighbors ()
	Get the maximum number of nearest neighbors to be searched for.
double	getMaximumSurfaceAngle ()
	Get the maximum surface angle.
double	getMinimumAngle ()
	Get the parameter for distance based weighting of neighbors.
double	getMu ()
	Get the nearest neighbor distance multiplier.
bool	getNormalConsistency ()
	Get the flag for consistently oriented normals.
std::vector< int >	getPartIDs ()
	Get the ID of each point after reconstruction.
std::vector< int >	getPointStates ()
	Get the state of each point after reconstruction.
double	getSearchRadius ()
	Get the sphere radius used for determining the k-nearest neighbors.
std::vector< int >	getSFN ()
	Get the sfn list.
	GreedyProjectionTriangulation ()
	Empty constructor.
void	setConsistentVertexOrdering (bool consistent_ordering)
	Set the flag to order the resulting triangle vertices consistently (positive direction around normal).
void	setMaximumAngle (double maximum_angle)
	Set the maximum angle each triangle can have.
void	setMaximumNearestNeighbors (int nnn)
	Set the maximum number of nearest neighbors to be searched for.
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.
void	setMinimumAngle (double minimum_angle)
	Set the minimum angle each triangle should have.
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).
void	setNormalConsistency (bool consistent)
	Set the flag if the input normals are oriented consistently.
void	setSearchRadius (double radius)
	Set the sphere radius that is to be used for determining the k-nearest neighbors used for triangulating.
Protected Attributes
bool	consistent_
	Set this to true if the normals of the input are consistently oriented.
bool	consistent_ordering_
	Set this to true if the output triangle vertices should be consistently oriented.
double	eps_angle_
	Maximum surface angle.
double	maximum_angle_
	The maximum angle for the triangles.
double	minimum_angle_
	The preferred minimum angle for the triangles.
double	mu_
	The nearest neighbor distance multiplier to obtain the final search radius.
int	nnn_
	The maximum number of nearest neighbors accepted by searching.
double	search_radius_
	The nearest neighbors search radius for each point and the maximum edge length.
Private Member Functions
void	addFringePoint (int v, int s)
	Add a new vertex to the advancing edge front and set its source point.
void	addTriangle (int a, int b, int c, std::vector< pcl::Vertices > &polygons)
	Add a new triangle to the current polygon mesh.
void	closeTriangle (std::vector< pcl::Vertices > &polygons)
	Whenever a query point is part of a boundary loop containing 3 points, that triangle is created (called if angle constraints make it possible)
void	connectPoint (std::vector< pcl::Vertices > &polygons, const int prev_index, const int next_index, const int next_next_index, const Eigen::Vector2f &uvn_current, const Eigen::Vector2f &uvn_prev, const Eigen::Vector2f &uvn_next)
	Forms a new triangle by connecting the current neighbor to the query point and the previous neighbor.
std::string	getClassName () const
	Class get name method.
std::vector< std::vector < size_t > >	getTriangleList (const pcl::PolygonMesh &input)
	Get the list of containing triangles for each vertex in a PolygonMesh.
void	performReconstruction (pcl::PolygonMesh &output)
	The actual surface reconstruction method.
void	performReconstruction (std::vector< pcl::Vertices > &polygons)
	The actual surface reconstruction method.
bool	reconstructPolygons (std::vector< pcl::Vertices > &polygons)
	The actual surface reconstruction method.
Static Private Member Functions
static bool	nnAngleSortAsc (const nnAngle &a1, const nnAngle &a2)
	Function for ascending sort of nnAngle, taking visibility into account (angles to visible neighbors will be first, to the invisible ones after).
Private Attributes
bool	already_connected_
	Flag to set if the next neighbor was already connected in the previous step. To avoid inconsistency it should not be connected again.
std::vector< nnAngle >	angles_
	A list of angles to neighbors.
bool	changed_1st_fn_
	Flag to set if the first fringe neighbor was changed.
bool	changed_2nd_fn_
	Flag to set if the second fringe neighbor was changed.
std::vector< Eigen::Vector3f >	coords_
	Temporary variable to store point coordinates.
int	current_index_
	Current point's index.
std::vector< int >	ffn_
	List of fringe neighbors in one direction.
std::vector< int >	fringe_queue_
	Points on the outer edge from which the mesh has to be grown.
bool	is_current_free_
	Flag to set if the current point is free.
int	new2boundary_
	New boundary point.
bool	next_is_ffn_
	Flag to set if the next point is the first fringe neighbor.
bool	next_is_sfn_
	Flag to set if the next point is the second fringe neighbor.
std::vector< int >	part_
	Connected component labels for each point.
bool	prev_is_ffn_
	Flag to set if the previous point is the first fringe neighbor.
bool	prev_is_sfn_
	Flag to set if the next point is the second fringe neighbor.
Eigen::Vector3f	proj_qp_
	Point coordinates projected onto the plane defined by the point normal.
int	R_
	Index of the current query point.
std::vector< int >	sfn_
	List of fringe neighbors in other direction.
std::vector< int >	source_
	List of sources.
std::vector< int >	state_
	List of point states.
Eigen::Vector3f	tmp_
	Temporary variable to store 3 coordiantes.
pcl::Vertices	triangle_
	Temporary variable to store a triangle (as a set of point indices)
Eigen::Vector3f	u_
	First coordinate vector of the 2D coordinate frame.
Eigen::Vector2f	uvn_ffn_
	2D coordinates of the first fringe neighbor
Eigen::Vector2f	uvn_next_ffn_
	2D coordinates of the first fringe neighbor of the next point
Eigen::Vector2f	uvn_next_sfn_
	2D coordinates of the second fringe neighbor of the next point
Eigen::Vector2f	uvn_sfn_
	2D coordinates of the second fringe neighbor
Eigen::Vector3f	v_
	Second coordinate vector of the 2D coordinate frame.

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 142 of file gp3.h.

Member Typedef Documentation

template<typename PointInT>

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

Reimplemented from pcl::PCLSurfaceBase< PointInT >.

Definition at line 149 of file gp3.h.

template<typename PointInT>

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

Reimplemented from pcl::PCLSurfaceBase< PointInT >.

Definition at line 150 of file gp3.h.

template<typename PointInT>

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

Definition at line 152 of file gp3.h.

template<typename PointInT>

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

Definition at line 154 of file gp3.h.

template<typename PointInT>

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

Definition at line 153 of file gp3.h.

Member Enumeration Documentation

template<typename PointInT>

anonymous enum

Enumerator:

NONE
FREE
FRINGE
BOUNDARY
COMPLETED

Definition at line 158 of file gp3.h.

Constructor & Destructor Documentation

template<typename PointInT>

pcl::GreedyProjectionTriangulation< PointInT >::GreedyProjectionTriangulation ( ) [inline]

Empty constructor.

Definition at line 168 of file gp3.h.

Member Function Documentation

template<typename PointInT>

void pcl::GreedyProjectionTriangulation< PointInT >::addFringePoint	(	int	v,
		int	s
	)		`[inline, private]`

Add a new vertex to the advancing edge front and set its source point.

Parameters:

[in]	v	index of the vertex that was connected
[in]	s	index of the source point

Definition at line 522 of file gp3.h.

template<typename PointInT>

void pcl::GreedyProjectionTriangulation< PointInT >::addTriangle	(	int	a,
		int	b,
		int	c,
		std::vector< pcl::Vertices > &	polygons
	)		`[inline, private]`

Add a new triangle to the current polygon mesh.

Parameters:

[in]	a	index of the first vertex
[in]	b	index of the second vertex
[in]	c	index of the third vertex
[out]	polygons	the polygon mesh to be updated

Definition at line 486 of file gp3.h.

template<typename PointInT >

void pcl::GreedyProjectionTriangulation< PointInT >::closeTriangle ( std::vector< pcl::Vertices > & polygons ) [private]

Whenever a query point is part of a boundary loop containing 3 points, that triangle is created (called if angle constraints make it possible)

Parameters:

[out] polygons the polygon mesh to be updated

Definition at line 1060 of file gp3.hpp.

template<typename PointInT >

void pcl::GreedyProjectionTriangulation< PointInT >::connectPoint	(	std::vector< pcl::Vertices > &	polygons,
		const int	prev_index,
		const int	next_index,
		const int	next_next_index,
		const Eigen::Vector2f &	uvn_current,
		const Eigen::Vector2f &	uvn_prev,
		const Eigen::Vector2f &	uvn_next
	)		`[private]`

Forms a new triangle by connecting the current neighbor to the query point and the previous neighbor.

Parameters:

[out]	polygons	the polygon mesh to be updated
[in]	prev_index	index of the previous point
[in]	next_index	index of the next point
[in]	next_next_index	index of the point after the next one
[in]	uvn_current	2D coordinate of the current point
[in]	uvn_prev	2D coordinates of the previous point
[in]	uvn_next	2D coordinates of the next point

Definition at line 1093 of file gp3.hpp.

template<typename PointInT>

std::string pcl::GreedyProjectionTriangulation< PointInT >::getClassName ( ) const [inline, private, virtual]

Class get name method.

Reimplemented from pcl::PCLSurfaceBase< PointInT >.

Definition at line 445 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::getConsistentVertexOrdering ( ) [inline]

Get the flag signaling consistently ordered triangle vertices.

Definition at line 292 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getFFN ( ) [inline]

Get the ffn list.

Definition at line 313 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::getMaximumAngle ( ) [inline]

Get the parameter for distance based weighting of neighbors.

Definition at line 259 of file gp3.h.

template<typename PointInT>

int pcl::GreedyProjectionTriangulation< PointInT >::getMaximumNearestNeighbors ( ) [inline]

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

Definition at line 226 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::getMaximumSurfaceAngle ( ) [inline]

Get the maximum surface angle.

Definition at line 271 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::getMinimumAngle ( ) [inline]

Get the parameter for distance based weighting of neighbors.

Definition at line 248 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::getMu ( ) [inline]

Get the nearest neighbor distance multiplier.

Definition at line 216 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::getNormalConsistency ( ) [inline]

Get the flag for consistently oriented normals.

Definition at line 281 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getPartIDs ( ) [inline]

Get the ID of each point after reconstruction.

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

Definition at line 304 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getPointStates ( ) [inline]

Get the state of each point after reconstruction.

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

Definition at line 298 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::getSearchRadius ( ) [inline]

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

Definition at line 237 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::getSFN ( ) [inline]

Get the sfn list.

Definition at line 309 of file gp3.h.

template<typename PointInT >

std::vector< std::vector< size_t > > pcl::GreedyProjectionTriangulation< PointInT >::getTriangleList ( const pcl::PolygonMesh & input ) [private]

Get the list of containing triangles for each vertex in a PolygonMesh.

Parameters:

[in] polygonMesh the input polygon mesh

Definition at line 1666 of file gp3.hpp.

template<typename PointInT>

static bool pcl::GreedyProjectionTriangulation< PointInT >::nnAngleSortAsc	(	const nnAngle &	a1,
		const nnAngle &	a2
	)		`[inline, static, private]`

Function for ascending sort of nnAngle, taking visibility into account (angles to visible neighbors will be first, to the invisible ones after).

Parameters:

[in]	a1	the first angle
[in]	a2	the second angle

Definition at line 535 of file gp3.h.

template<typename PointInT >

void pcl::GreedyProjectionTriangulation< PointInT >::performReconstruction ( pcl::PolygonMesh & output ) [private, virtual]

The actual surface reconstruction method.

Parameters:

[out] output the resultant polygonal mesh

NOTE: usually the number of triangles is around twice the number of vertices

Implements pcl::MeshConstruction< PointInT >.

Definition at line 46 of file gp3.hpp.

template<typename PointInT >

void pcl::GreedyProjectionTriangulation< PointInT >::performReconstruction ( std::vector< pcl::Vertices > & polygons ) [private, virtual]

The actual surface reconstruction method.

Parameters:

[out] polygons the resultant polygons, as a set of vertices. The Vertices structure contains an array of point indices.

NOTE: usually the number of triangles is around twice the number of vertices

Implements pcl::MeshConstruction< PointInT >.

Definition at line 61 of file gp3.hpp.

template<typename PointInT >

bool pcl::GreedyProjectionTriangulation< PointInT >::reconstructPolygons ( std::vector< pcl::Vertices > & polygons ) [private]

The actual surface reconstruction method.

Parameters:

[out] polygons the resultant polygons, as a set of vertices. The Vertices structure contains an array of point indices.

NOTE: discarding NaN points and those that are not in indices_

NOTE: nnIdx was reset

TODO: document!

Definition at line 74 of file gp3.hpp.

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_ordering set it to true if triangle vertices should be ordered consistently

Definition at line 288 of file gp3.h.

template<typename PointInT>

void pcl::GreedyProjectionTriangulation< PointInT >::setMaximumAngle ( double maximum_angle ) [inline]

Set the maximum angle each triangle can have.

Parameters:

[in] maximum_angle the maximum angle each triangle can have

Note:: For best results, its value should be around 120 degrees

Definition at line 255 of file gp3.h.

template<typename PointInT>

void pcl::GreedyProjectionTriangulation< PointInT >::setMaximumNearestNeighbors ( int nnn ) [inline]

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

Parameters:

[in] nnn the maximum number of nearest neighbors

Definition at line 222 of file gp3.h.

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_angle maximum 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 267 of file gp3.h.

template<typename PointInT>

void pcl::GreedyProjectionTriangulation< PointInT >::setMinimumAngle ( double minimum_angle ) [inline]

Set the minimum angle each triangle should have.

Parameters:

[in] minimum_angle the 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 244 of file gp3.h.

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] mu the multiplier

Definition at line 212 of file gp3.h.

template<typename PointInT>

void pcl::GreedyProjectionTriangulation< PointInT >::setNormalConsistency ( bool consistent ) [inline]

Set the flag if the input normals are oriented consistently.

Parameters:

[in] consistent set it to true if the normals are consistently oriented

Definition at line 277 of file gp3.h.

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] radius the sphere radius that is to contain all k-nearest neighbors

Note:: This distance limits the maximum edge length!

Definition at line 233 of file gp3.h.

Member Data Documentation

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::already_connected_ [private]

Flag to set if the next neighbor was already connected in the previous step. To avoid inconsistency it should not be connected again.

Definition at line 405 of file gp3.h.

template<typename PointInT>

std::vector<nnAngle> pcl::GreedyProjectionTriangulation< PointInT >::angles_ [private]

A list of angles to neighbors.

Definition at line 367 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::changed_1st_fn_ [private]

Flag to set if the first fringe neighbor was changed.

Definition at line 396 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::changed_2nd_fn_ [private]

Flag to set if the second fringe neighbor was changed.

Definition at line 398 of file gp3.h.

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 335 of file gp3.h.

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 338 of file gp3.h.

template<typename PointInT>

std::vector<Eigen::Vector3f> pcl::GreedyProjectionTriangulation< PointInT >::coords_ [private]

Temporary variable to store point coordinates.

Definition at line 364 of file gp3.h.

template<typename PointInT>

int pcl::GreedyProjectionTriangulation< PointInT >::current_index_ [private]

Current point's index.

Definition at line 386 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::eps_angle_ [protected]

Maximum surface angle.

Definition at line 332 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::ffn_ [private]

List of fringe neighbors in one direction.

Definition at line 375 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::fringe_queue_ [private]

Points on the outer edge from which the mesh has to be grown.

Definition at line 381 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::is_current_free_ [private]

Flag to set if the current point is free.

Definition at line 384 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::maximum_angle_ [protected]

The maximum angle for the triangles.

Definition at line 329 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::minimum_angle_ [protected]

The preferred minimum angle for the triangles.

Definition at line 326 of file gp3.h.

template<typename PointInT>

double pcl::GreedyProjectionTriangulation< PointInT >::mu_ [protected]

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

Definition at line 317 of file gp3.h.

template<typename PointInT>

int pcl::GreedyProjectionTriangulation< PointInT >::new2boundary_ [private]

New boundary point.

Definition at line 400 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::next_is_ffn_ [private]

Flag to set if the next point is the first fringe neighbor.

Definition at line 392 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::next_is_sfn_ [private]

Flag to set if the next point is the second fringe neighbor.

Definition at line 394 of file gp3.h.

template<typename PointInT>

int pcl::GreedyProjectionTriangulation< PointInT >::nnn_ [protected]

The maximum number of nearest neighbors accepted by searching.

Definition at line 323 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::part_ [private]

Connected component labels for each point.

Definition at line 379 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::prev_is_ffn_ [private]

Flag to set if the previous point is the first fringe neighbor.

Definition at line 388 of file gp3.h.

template<typename PointInT>

bool pcl::GreedyProjectionTriangulation< PointInT >::prev_is_sfn_ [private]

Flag to set if the next point is the second fringe neighbor.

Definition at line 390 of file gp3.h.

template<typename PointInT>

Eigen::Vector3f pcl::GreedyProjectionTriangulation< PointInT >::proj_qp_ [private]

Point coordinates projected onto the plane defined by the point normal.

Definition at line 408 of file gp3.h.

template<typename PointInT>

int pcl::GreedyProjectionTriangulation< PointInT >::R_ [private]

Index of the current query point.

Definition at line 369 of file gp3.h.

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 320 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::sfn_ [private]

List of fringe neighbors in other direction.

Definition at line 377 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::source_ [private]

List of sources.

Definition at line 373 of file gp3.h.

template<typename PointInT>

std::vector<int> pcl::GreedyProjectionTriangulation< PointInT >::state_ [private]

List of point states.

Definition at line 371 of file gp3.h.

template<typename PointInT>

Eigen::Vector3f pcl::GreedyProjectionTriangulation< PointInT >::tmp_ [private]

Temporary variable to store 3 coordiantes.

Definition at line 423 of file gp3.h.

template<typename PointInT>

pcl::Vertices pcl::GreedyProjectionTriangulation< PointInT >::triangle_ [private]

Temporary variable to store a triangle (as a set of point indices)

Definition at line 362 of file gp3.h.

template<typename PointInT>

Eigen::Vector3f pcl::GreedyProjectionTriangulation< PointInT >::u_ [private]

First coordinate vector of the 2D coordinate frame.

Definition at line 410 of file gp3.h.

template<typename PointInT>

Eigen::Vector2f pcl::GreedyProjectionTriangulation< PointInT >::uvn_ffn_ [private]

2D coordinates of the first fringe neighbor

Definition at line 414 of file gp3.h.

template<typename PointInT>

Eigen::Vector2f pcl::GreedyProjectionTriangulation< PointInT >::uvn_next_ffn_ [private]

2D coordinates of the first fringe neighbor of the next point

Definition at line 418 of file gp3.h.

template<typename PointInT>

Eigen::Vector2f pcl::GreedyProjectionTriangulation< PointInT >::uvn_next_sfn_ [private]

2D coordinates of the second fringe neighbor of the next point

Definition at line 420 of file gp3.h.

template<typename PointInT>

Eigen::Vector2f pcl::GreedyProjectionTriangulation< PointInT >::uvn_sfn_ [private]

2D coordinates of the second fringe neighbor

Definition at line 416 of file gp3.h.

template<typename PointInT>

Eigen::Vector3f pcl::GreedyProjectionTriangulation< PointInT >::v_ [private]

Second coordinate vector of the 2D coordinate frame.

Definition at line 412 of file gp3.h.

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

Classes

Public Types

Public Member Functions

Protected Attributes

Private Member Functions

Static Private Member Functions

Private Attributes

Detailed Description

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

Member Typedef Documentation

Member Enumeration Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

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