Finds centerlines of closed 2D geometries. It is focused on letter like shapes, i.e. vertex loops with potential enclosed islands of loops. Loops directly connected to other loops does not work at the moment.
It uses a segmented voronoi diagram as a base, then it filters out the 'spiky' bits (green) by comparing the angle between the edge (green), and the input geometry (red) that created it. If the angle is close to 90°, it will be ignored. Note that the result (blue) technically is not a true centerline after the spikes has been filtered out, but it makes for much cleaner tool-paths etc. It also performs a line simplification on the resulting center-line.
```rust
let segments = ...same as boost voronoi segments...
let mut centerline = Centerline::
let = centerline.calculatecenterline(cosangle, centerlinesimplification, None)?; println!( "Result: lines:{}, linestrings:{}", centerline.lines.asref().mapor(0,|x|x.len()), centerline.linestrings.asref().mapor(0,|x|x.len()) ); ```
fish
cargo +nightly run --example fltk_gui --features="impl-wavefront"
The example only displays 2D, but the generated center-line is actually 3D line segments.\
The Z coordinate is the distance between the 2D center-line, and the geometry that created it.
The example GUI takes .obj files as input. The .obj file needs to be 2D in some axis aligned plane (one of the coordinates needs to be zero).
Also make sure there are no intersecting outer edges.
Requires #![feature(hash_drain_filter)] and #![feature(map_first_last)] i.e. rust +nightly