A class for polygon–polygon intersection in 2d space.
#include <dumux/geometry/geometryintersection.hh>
|
| using | ctype = typename Policy::ctype |
| using | Point = typename Policy::Point |
| using | Intersection = typename Policy::Intersection |
|
| template<class P = Policy, std::enable_if_t< P::dimIntersection==2, int > = 0> |
| static bool | intersection (const Geometry1 &geo1, const Geometry2 &geo2, Intersection &intersection) |
| | Colliding two polygons.
|
| template<class P = Policy, std::enable_if_t< P::dimIntersection==1, int > = 0> |
| static bool | intersection (const Geometry1 &geo1, const Geometry2 &geo2, Intersection &intersection) |
| | Colliding two polygons.
|
| template<class P = Policy, std::enable_if_t< P::dimIntersection==0, int > = 0> |
| static bool | intersection (const Geometry1 &geo1, const Geometry2 &geo2, Intersection &intersection) |
| | Colliding two polygons.
|
◆ ctype
template<class Geometry1, class Geometry2, class Policy>
◆ Intersection
template<class Geometry1, class Geometry2, class Policy>
◆ Point
template<class Geometry1, class Geometry2, class Policy>
◆ intersection() [1/3]
template<class Geometry1, class Geometry2, class Policy>
template<class P = Policy, std::enable_if_t< P::dimIntersection==0, int > = 0>
- Parameters
-
| geo1/geo2 | The geometries to intersect |
| intersection | The intersection point |
- Note
- this overload is used when point-like intersections are seeked
◆ intersection() [2/3]
template<class Geometry1, class Geometry2, class Policy>
template<class P = Policy, std::enable_if_t< P::dimIntersection==1, int > = 0>
- Parameters
-
| geo1/geo2 | The geometries to intersect |
| intersection | Container to store the corners of intersection segment |
- Note
- this overload is used when segment-like intersections are seeked
◆ intersection() [3/3]
template<class Geometry1, class Geometry2, class Policy>
template<class P = Policy, std::enable_if_t< P::dimIntersection==2, int > = 0>
- Note
- First we find the vertex candidates for the intersection region as follows: Add polygon vertices that are inside the other polygon Add intersections of polygon edges Remove duplicate points from the list Compute the convex hull polygon Return a triangulation of that polygon as intersection
- Parameters
-
| geo1/geo2 | The geometries to intersect |
| intersection | Container to store the corner points of the polygon (as convex hull) |
- Note
- This overload is used when polygon like intersections are seeked
The documentation for this class was generated from the following file: