Functions
TL_DLL void	removeDuplicatedCoords (vector< TeCoord2D > &coordSet)
	If we have the two end point equals, so we remove it.
TL_DLL TePolygon	TeConvexHull (std::vector< TeCoord2D > &coordSet)
	This is a explicit specialization that returns the convex hull of a TeCoord2D set.
TL_DLL TePolygon	TeConvexHull (const TePolygon &p)
	This is a explicit specialization that returns the convex hull of a TePolygon.
TL_DLL TePolygon	TeConvexHull (const TePolygonSet &ps)
	This is a explicit specialization that returns the convex hull of a TePolygonSet.
TL_DLL TePolygon	TeConvexHull (const TePointSet &ps)
	This is a explicit specialization that returns the convex hull of a TePointSet. Must be defined!
template<class T >
TePolygon	TeConvexHull (const T &coordSet)
	Returns the convexhull of a given list of coords in counterclockwise.

Detailed Description

Functions that returns the convex hull of a point list.

Function Documentation

TL_DLL void removeDuplicatedCoords ( vector< TeCoord2D > & coordSet )

If we have the two end point equals, so we remove it.

template<class T >

TePolygon TeConvexHull ( const T & coordSet )

Returns the convexhull of a given list of coords in counterclockwise.

Parameters:

coordSet A list with coordinates without duplicated coordinates.

Note:: This algorithm is based on the book Computational Geometry by M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf - Springer Verlag - pp. 6. It is O(N log N).

TL_DLL TePolygon TeConvexHull ( const TePointSet & ps )

This is a explicit specialization that returns the convex hull of a TePointSet. Must be defined!

TL_DLL TePolygon TeConvexHull ( const TePolygonSet & ps )

This is a explicit specialization that returns the convex hull of a TePolygonSet.

TL_DLL TePolygon TeConvexHull ( const TePolygon & p )

This is a explicit specialization that returns the convex hull of a TePolygon.

TL_DLL TePolygon TeConvexHull ( std::vector< TeCoord2D > & coordSet )

This is a explicit specialization that returns the convex hull of a TeCoord2D set.