areas.h File Reference

#include <geometry_msgs/Point32.h>
#include <sensor_msgs/PointCloud.h>
#include <geometry_msgs/Polygon.h>
#include <door_handle_detector/geometry/nearest.h>

Include dependency graph for areas.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	cloud_geometry
namespace	cloud_geometry::areas
Functions
bool	cloud_geometry::areas::comparePoint2D (const geometry_msgs::Point32 &p1, const geometry_msgs::Point32 &p2)
	Sort the Point32 points in vector structures according to their .x/.y values.
bool	cloud_geometry::areas::comparePoint3D (const geometry_msgs::Point32 &p1, const geometry_msgs::Point32 &p2)
	Sort 3d points in vector structures according to their .x/.y/.z values.
double	cloud_geometry::areas::compute2DPolygonalArea (const geometry_msgs::Polygon &polygon)
	Compute the area of a 2D planar polygon patch. The normal is computed automatically.
double	cloud_geometry::areas::compute2DPolygonalArea (const geometry_msgs::Polygon &polygon, const std::vector< double > &normal)
	Compute the area of a 2D planar polygon patch - using a given normal.
double	cloud_geometry::areas::compute2DPolygonalArea (const sensor_msgs::PointCloud &points, const std::vector< double > &normal)
	Compute the area of a 2D planar polygon patch - using a given normal.
bool	cloud_geometry::areas::compute2DPolygonNormal (const geometry_msgs::Polygon &poly, std::vector< double > &normal)
void	cloud_geometry::areas::convexHull2D (const std::vector< geometry_msgs::Point32 > &points, geometry_msgs::Polygon &hull)
	Compute a 2D convex hull using Andrew's monotone chain algorithm.
void	cloud_geometry::areas::convexHull2D (const sensor_msgs::PointCloud &points, const std::vector< int > &indices, const std::vector< double > &coeff, geometry_msgs::Polygon &hull)
	Compute a 2D convex hull in 3D space using Andrew's monotone chain algorithm.
bool	cloud_geometry::areas::isPointIn2DPolygon (const geometry_msgs::Point32 &point, const geometry_msgs::Polygon &polygon)
	Check if a 2d point (X and Y coordinates considered only!) is inside or outisde a given polygon.