Checks if three points are in one line. With a maximum deviation of the given distance tolerance. 1e-6 by default. Fails if any of the points are closer than the given distance tolerance to each other.

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 square 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. See Points.areInLine function too.

Returns the area of a triangle described by 3 points.

Returns the double square area of a triangle. This is the fastest way to get a comparison or sorting value for the area of a triangle. This is just the square length of the Cross Product vector. The length of a Cross Product vector is equal to the area of the parallelogram described by the two input vectors.

Finds the center, mean or average point.

Returns the closest 2D point form a point list to a given 2D point.

Returns the closest point form a 3D point list to a given 3D point.

Returns the closest 2D point index form a 2D point list to a given 2D point.

Returns the closest 3D point index form a 3D point list to a given 3D point.

Returns the indices of the 2D points that are closest to each other.

Returns the indices of the 3D points that are closest to each other.

Culls 2D points if they are to close to previous or next item. Last and first 2D points stay the same.

Culls 3D points if they are to close to previous or next item. Last and first 3D points stay the same.

Similar to Join Polylines this tries to find continuos sequences of 3D points. 'tolGap' is the maximum allowable gap between the start and the endpoint of to segments. Search starts from the segment with the most points. Both start and end point of each 3D point list is checked for adjacency.

Similar to join polylines this tries to find continuos sequences of 2D points. 'tolGap' is the maximum allowable gap between the start and the endpoint of to segments. Search starts from the segment with the most points. Both start and end point of each 2D point list is checked for adjacency.

The sign is negative if the loop is clockwise. Last and first point should be the same.

Given two lists of 2D points finds the pair that are closest to each other and returns their distance.

Given two lists of 3D points finds the pair that are closest to each other and returns their distance.

Find the 2D point that has the biggest distance to any 2D point from another set.

Find the 3D point that has the biggest distance to any 3D point from another set.

Find the index of the 2D point that has the biggest distance to any 2D point from the other set. Basically the most lonely point in 'findPointFrom' list with respect to 'checkAgainst' list. Returns findPointFromIdx * checkAgainstIdx

Find the index of the 3D point that has the biggest distance to any 3D point from the other set. Basically the most lonely point in 'findPointFrom' list with respect to 'checkAgainst' list. Returns findPointFromIdx * checkAgainstIdx

Finds the mean normal of many points. It finds the center point and then takes cross-products iterating all points in pairs of two. The first three points define the orientation of the normal. So it considers the current order of points too. If the order is counterclockwise in the World X-Y plane then the normal is in world Z orientation.

Finds the mean normal of many points. It finds the center point and then takes cross-products iterating all points in pairs of two. The first three points define the orientation of the normal. So it considers the current order of points too. If the order is counterclockwise in the World X-Y plane then the normal is in world Z orientation.

It finds the inner offset point in a corner (defined by a Polyline from 3 points (prevPt, thisPt and nextPt) The offset from first and second segment are given separately and can vary (prevDist and nextDist). Use negative distance for outer offset. If Points are collinear by 0.25 degrees or less than 1-e6 units apart returns: ValueNone. Use negative distances to get outside offset.

It finds the inner offset point in a corner (defined a point, a previous vector to this point and a next vector from this point) The offset from first and second segment are given separately and can vary (prevDist and nextDist). Use negative distance for outer offset. If Points are collinear by 0.25 degrees or less than 1-e6 units apart returns: ValueNone. Use negative distances to get outside offset.

It finds the inner offset point in a corner (defined by a Polyline from 3 points (prevPt, thisPt and nextPt) The offset from first and second segment are given separately and can vary (prevDist and nextDist). Use negative distance for outer offset. If Points are collinear by 0.25 degrees or less than 1-e6 units apart returns: ValueNone. Use negative distances to get outside offset. The 'referenceNormal' is' An approximate orientation Normal to help find the correct offset side, To be in Z Axis orientation for Counter-Clockwise loops in 2D. Returns the offset point, the unitized normal vector aligned with the referenceNormal, the shift direction for prev and next line.

It finds the inner offset point in a corner (defined a point, a previous vector to this point and a next vector from this point) The offset from first and second segment are given separately and can vary (prevDist and nextDist). Use negative distance for outer offset. If Points are collinear by 0.25 degrees or less than 1-e6 units apart returns: ValueNone. Use negative distances to get outside offset. The 'referenceNormal' is' An approximate orientation Normal to help find the correct offset side, To be in Z Axis orientation for Counter-Clockwise loops in 2D. Returns the offset point, the unitized normal vector aligned with the referenceNormal, the shift direction for prev and next line.

It finds the inner offset point in a corner (defined by a Polyline from 3 points (prevPt, thisPt and nextPt) The offset from first and second segment are given separately and can vary (prevDist and nextDist). Use negative distance for outer offset. If Points are collinear by 0.25 degrees or less than 1-e6 units apart returns: ValueNone. Use negative distances to get outside offset. 'referenceOrient' is positive for counterclockwise loops otherwise negative. Returns the offset point, the shift direction for prev and next line.

It finds the inner offset point in a corner (defined a point, a previous vector to this point and a next vector from this point) The offset from first and second segment are given separately and can vary (prevDist and nextDist). Use negative distance for outer offset. If Points are collinear by 0.25 degrees or less than 1-e6 units apart returns: ValueNone. Use negative distances to get outside offset. 'referenceOrient' is positive for counterclockwise loops otherwise negative. Returns the offset point, the shift direction for prev and next line.