Autoware.Auto
convex_hull.hpp File Reference

This file implements the monotone chain algorithm to compute 2D convex hulls on linked lists of points. More...

#include <common/types.hpp>
#include <geometry/common_2d.hpp>
#include <algorithm>
#include <list>
#include <limits>
#include <utility>
Include dependency graph for convex_hull.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 autoware
 This file defines the lanelet2_map_provider_node class.
 
 autoware::common
 
 autoware::common::geometry
 
 autoware::common::geometry::details
 Contains computation geometry functions not intended for the end user to directly use.
 

Functions

template<typename PointT , typename HullT >
void autoware::common::geometry::details::form_lower_hull (std::list< PointT > &points, std::list< HullT > &hull)
 Moves points comprising the lower convex hull from points to hull. More...
 
template<typename PointT , typename HullT >
void autoware::common::geometry::details::form_upper_hull (std::list< PointT > &points, std::list< HullT > &hull)
 Moves points comprising the lower convex hull from points to hull. More...
 
template<typename PointT >
std::list< PointT >::const_iterator autoware::common::geometry::details::convex_hull_impl (std::list< PointT > &list)
 A static memory implementation of convex hull computation. Shuffles points around the deque such that the points of the convex hull of the deque of points are first in the deque, with the internal points following in an unspecified order. The head of the deque will be the point with the smallest x value, with the other points following in a counter-clockwise manner (from a top down view/facing -z direction) More...
 
template<typename PointT >
std::list< PointT >::const_iterator autoware::common::geometry::convex_hull (std::list< PointT > &list)
 A static memory implementation of convex hull computation. Shuffles points around the deque such that the points of the convex hull of the deque of points are first in the deque, with the internal points following in an unspecified order. More...
 

Detailed Description

This file implements the monotone chain algorithm to compute 2D convex hulls on linked lists of points.