Algorithms to compute intersections. More...
#include <config.h>
#include <geometry/geometry.h>
#include <vector>
Go to the source code of this file.
Namespaces | |
namespace | geometry |
Algorithmic geometry. | |
Functions | |
bool | geometry::lineLineIntersection (Point2d &u, const Point2d &p1, const Point2d &u1, const Point2d &p2, const Point2d &u2) |
Find if the segment [p1,p2] intersect the line going through p of normal n. | |
bool | geometry::lineSegmentIntersection (Point2d &u, const Point2d &p1, const Point2d &p2, const Point2d &p, const Point2d &n) |
Find if the segment [p1,p2] intersect the line going through p of normal n. | |
bool | geometry::lineTriangleIntersection (Point3d &u, double &s, const Point3d &p1, const Point3d &p2, const Point3d &tr1, const Point3d &tr2, const Point3d &tr3) |
Line-triangle intersection. | |
bool | geometry::planeLineIntersection (Point3d &u, double &s, const Point3d &p, const Point3d &n, const Point3d &u1, const Point3d &u2) |
Plane-Line Intersection. | |
template<typename PointContainer > | |
bool | geometry::pointInPolygon (const Point2d &p, const PointContainer &polygon) |
bool | geometry::pointInPolygon (const Point2d &p, const std::vector< Point2d > &polygon) |
Find if the point p is inside the polygon using the winding number. | |
bool | geometry::pointInTriangle (Point3d &u, double &s, const Point3d &p, const Point3d &p1, const Point3d &p2, const Point3d &p3) |
Point in triangle test (3D). | |
bool | geometry::pointInTriangle (const Point2d &p, const Point2d &p1, const Point2d &p2, const Point2d &p3) |
Point in triangle test (2D). | |
bool | geometry::segmentSegmentIntersection (Point2d &u, const Point2d &p1, const Point2d &p2, const Point2d &q1, const Point2d &q2) |
Find if two 2D segments intersect. |
Algorithms to compute intersections.
Definition in file intersection.h.