Expand description
This library contains data structures and methods that deals with lines in 2D and 3D space.
There are 2D implementations of:
- LineString, a sequence of points, aka Polyline.
- Line, a finite two-point struct (no rays).
- Ramer–Douglas-Peucker and
- Visvalingam-Whyatt line simplification algorithms.
- Sampling of boostvoronoi parabolic arc curves.
- LineString2 convex hull calculation (gift wrapping & Graham scan)
- Aabb axis aligned bounding box.
- Self intersection tests for line strings, or groups of lines O( n log n + i log n).
- Convex hull containment test (single threaded or multithreaded with ryon)
- Simple affine transformation (pan, zoom)