convexhull.hpp File Reference

Convex hull algorithms built from Pangolin point predicates. More...

#include "algorithm/redbluesweep.hpp"
#include <algorithm>
#include <cstddef>
#include <iterator>
#include <type_traits>
#include <vector>

Go to the source code of this file.

Namespaces
namespace	pgl

Functions
template<class Container>
auto	pgl::grahamScan (const Container &points_)
	Computes the convex hull of a point container using Graham's scan.
template<class Container>
auto	pgl::grahamScanExtended (const Container &points_)
	Computes the convex hull of a point container using Graham's scan.
template<class Container>
auto	pgl::convexHull (const Container &points_)
	Computes the convex hull of a point container.
template<class Container>
auto	pgl::convexHullExtended (const Container &points_)
	Computes the convex hull of a point container.

Detailed Description

Convex hull algorithms built from Pangolin point predicates.

Algorithm headers sit above the shape API and express reusable geometry procedures in terms of the public primitives.