Pangolin
Header-only C++20 plane computational geometry library
Loading...
Searching...
No Matches
pgl::BoundedPolygonalConcept Concept Reference

Bounded polygonal primitives, convex or not. More...

#include <forward.hpp>

Concept definition

template<class T>
concept BoundedPolygonalConcept =
BoundedConvexConcept<T> || PolygonConcept<T> || PolylineConcept<T> ||
MonotoneChainConcept<T> || PolygonWithHolesConcept<T> || PolygonSetConcept<T>
pgl::BoundedConvexConcept
Bounded convex primitives.
Definition forward.hpp:339
pgl::BoundedPolygonalConcept
Bounded polygonal primitives, convex or not.
Definition forward.hpp:373
pgl::MonotoneChainConcept
Definition forward.hpp:320
pgl::PolygonConcept
Definition forward.hpp:316
pgl::PolygonSetConcept
Definition forward.hpp:318
pgl::PolygonWithHolesConcept
Definition forward.hpp:317
pgl::PolylineConcept
Definition forward.hpp:321

Detailed Description

Bounded polygonal primitives, convex or not.

Exactly the shapes that are the convex hull of finitely many vertices their vertices() accessor lists, which is what a support function needs: the extreme point of one of these in any direction is one of its vertices, found exactly by comparing cross products. DiskConcept is bounded and is not one of these — its support point is off the lattice in every direction but four.