spade
spade copied to clipboard
Stoeoef
Delaunay Triangulations for the Rust Ecosystem
Spade 2.0 removed interpolation support (e.g. natural neighbor interpolation) to get into a releasable state. This ticket aims to re-introduce them! For the most part, it should be possible to...
Hello, first of all thank you for sharing this library! For my usecase I need to remove vertices often. But I also need to store some vertex handles for later....
Hi, I noticed your 2.0 post and was wondering whether you have any plans or ideas to add support for intersecting constraints for the CDT.
I'm getting an error for code that I believe should work. Here's my minimal reproduction: ```Rust use spade::{ConstrainedDelaunayTriangulation, Point2, Triangulation}; fn main() { let vertices = vec
Hi! Are there any plans on using data types and algorithms that enables SIMD support? There is an interesting article on that here https://www.rustsim.org/blog/2020/03/23/simd-aosoa-in-nalgebra/ that mentions the crates https://crates.io/crates/ultraviolet and...
I don't know much about the computer science behind 2D/3D delaunay so this might be a bad question, but I might as well as it anyway! I've been looking for...
With the introduction of `try_add_constraint` and `add_constraint_and_split` CDTs can finally be created without the risk of `panic` when built iteratively. However, the much more efficient bulk loading doesn't support this...
This test case panics: ```rust #[test] fn edge_intersection_precision_test_3() -> Result { let edges = [ [ Point2 { x: 7.9910984, y: -59.344463, }, Point2 { x: 15.484455, y: -48.762936, },...
It would be nice to apply relaxation to the voronoi graph to evenly space out the vertices for constrained triangulation. https://en.wikipedia.org/wiki/Lloyd%27s_algorithm 
