Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
src/geometry/two_d/intersect.h File Reference
#include "utils/preconditions/preconditions.h"
#include "signum.h"
#include <algorithm>
#include "linesegment.h"
Include dependency graph for intersect.h:

Go to the source code of this file.

Namespaces

namespace  geometry
namespace  geometry::two_d

Enumerations

enum  geometry::two_d::IntersectType { geometry::two_d::NO_INTERSECT, geometry::two_d::INTERSECT, geometry::two_d::TANGENCY, geometry::two_d::OVERLAY }

Functions

template<typename T >
bool geometry::two_d::pointOnLine (Point< T > p, LineSegment< T > s)
template<typename T >
bool geometry::two_d::pointOnLineSegment (Point< T > p, LineSegment< T > s, bool acceptCorners)
template<typename T >
IntersectType geometry::two_d::intervalIntersect (T a1, T a2, T b1, T b2)
template<typename T >
IntersectType geometry::two_d::intersectLineLineSegment (const LineSegment< T > &line, const LineSegment< T > &segment)
template<typename T >
IntersectType geometry::two_d::intersectLineSegmentLineSegment (const LineSegment< T > &segment1, const LineSegment< T > &segment2)
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines