Returns the area of a triangle described by 3 points.

Returns the double area of a triangle. This is the fastest way to get a comparison or sorting value for the areas of triangles. This is just the length of the cross product vector.

Calculates the intersection of a finite line with a triangle. Returns Some(Pnt) or None if no intersection was found, or if the input line has near zero length, or if the input triangle has near zero area. This algorithm still returns an intersection even if line and triangle are almost parallel. Since it is using the triple product, it is hard to find an appropriate tolerance for considering lines and triangles parallel based on the volume of the tetrahedron between them.

Checks if three points are in one line. By finding the biggest angle in the triangle. And then measuring the distance from this point to the line defined by the other two points.

Checks if three points are in one line. This is a very fast check, but it is hard to find an appropriate tolerance. (Default is 0.001) This tolerance is the area of the parallelogram described by two vectors created from the 3 points. So it also returns true if the points are equal or very close to each other. Returns false for NaN input values. Use Points.areInLine if you need better control over the actual tolerance distance.

Offsets all points by a given distance. The offset is inwards for positive distance and outwards for negative distance.

Offsets one point by a given distance. If the points 'prev', 'this' and 'next' are in counter-clockwise order, the offset is inwards. Otherwise it is outwards. A negative offset distance inverts the direction.

Finds the offset point based on the previous and next unit normals (= offset direction), and their offset distances.