Class Polyline

Reverses point order of polyline (flips direction). Example: points=[[0,0,0], [1,0,0], [2,0,0]] → [[2,0,0], [1,0,0], [0,0,0]]

Converts polyline to line segments (each segment as line object with start/end). Closed polylines include closing segment. Example: 3 points → 2 or 3 lines (depending on isClosed)

Converts polyline to segment arrays (each segment as [point1, point2]). Closed polylines include closing segment if endpoints differ. Example: 4 points, closed → 4 segments connecting all points in a loop

Creates a polyline from points array with optional isClosed flag. Example: points=[[0,0,0], [1,0,0], [1,1,0]], isClosed=true → {points:..., isClosed:true}

Calculates the maximum possible half-line fillet radius for each corner of a given polyline. For a closed polyline, it includes the corners connecting the last segment back to the first.

The calculation uses the 'half-line' constraint, meaning the fillet's tangent points must lie within the first half of each segment connected to the corner.

Calculates the single safest maximum fillet radius that can be applied uniformly to all corners of a polyline, based on the 'half-line' constraint. This is determined by finding the minimum of the maximum possible fillet radii calculated for each individual corner.

Calculates total length of polyline by summing distances between consecutive points. Example: points=[[0,0,0], [3,0,0], [3,4,0]] → 3 + 4 = 7

Counts number of points in polyline. Example: polyline with points=[[0,0,0], [1,0,0], [1,1,0]] → 3

Extracts points array from polyline object. Example: polyline={points:[[0,0,0], [1,0,0]]} → [[0,0,0], [1,0,0]]

Finds intersection points between two polylines (all segment-segment crossings). Tests all segment pairs and deduplicates close points. Example: crossing polylines forming an X → returns center intersection point

Finds points where polyline crosses itself (self-intersection points). Skips adjacent segments and deduplicates close points. Example: figure-8 shaped polyline → returns center crossing point

Sorts scrambled segments into connected polylines by matching endpoints. Uses spatial hashing for efficient connection finding. Example: 10 random segments that form 2 connected paths → 2 polylines

Applies transformation matrix to all points in polyline (rotates, scales, or translates). Example: polyline with 4 points, translation [5,0,0] → all points moved +5 in X direction