Boost 1.76.0 polygon::voronoi ported to 100% rust. This implementation of Fortune's algorithm works for line segments as well as points, making it useful for calculating centerlines (like the title image above).
Code still in development, there are still bugs. However, all the remaining bugs I've noticed are also present in C++ boost voronoi.
Gui example:
sh
cargo run --example fltk_gui
* Mouse click to place new points.
* Press and hold 'L' + mouse click to add a single line.
* Press and hold 'S' + mouse click to add strings of lines.
* Use mouse wheel to zoom.
* Mouse click and drag to pan.
API example: ```rust use boostvoronoi::prelude::*;
type I = i32; // this is the integer input type type F = f64; // this is the float output type
fn main() -> Result<(), BvError> {
// Only unique Points will be used. Points should not
// intersect lines.
let p = vec!([9i32, 10]);
// Lines may only intersect at the endpoints.
let s = vec!([10i32, 11, 12, 33]);
let diagram = Builder::with_vertices() accepts iterators of anything that
// implements Into<boostvoronoi::Point>
.withvertices(p.iter())?
// with_segments() accepts iterators of anything that
// implements Into<boostvoronoi::Line>
.withsegments(s.iter())?
// this will generate the list of cells, edges and circle
// events (aka vertices)
.build()?;
println!(
"Result: cells:{}, edges:{}, vertices:{}",
diagram.cells().len(),
diagram.edges().len(),
diagram.vertices().len()
);
// The values inside the diagram are wrapped in Rc<Cell<T>>
for cell in diagram.cells().iter().map(|c| c.get()) {
println!("Cell : {}", cell.id().0);
for edgeid in diagram.celledgeiterator(cell.id()) {
let edge = diagram.getedge(edgeid)?.get();
// The vertices of an edge will have the value None
// if they are infinitely far away.
println!(
" edge: {}, from:{:?} to:{:?}",
edgeid.0,
edge.vertex0(),
diagram.edgegetvertex1(edge_id)?
);
}
}
Ok(())
}
```
Edges will become curves when line segments are used as input, see the example code for discretization and interpolation.
The crate is only tested on 1.56 and above.
The code uses #![feature(map_first_last)] if run on +nightly, this is only emulated on +stable.
So +nightly should be somewhat faster.
voronoi_robust_ftp.rs.todo: tags.serde to SyncDiagram and other diagram types. cgmath,glam,mint & geo)All credit goes to the original author (Andrii Sydorchuk) and the boost contributors, except the porting mistakes. They are all mine.