spade
spade copied to clipboard
Stoeoef
Delaunay Triangulations for the Rust Ecosystem
This resembles the name of the function better and does what the comment says Signed-off-by: gabsi26
Spade 2.0 looks great API-wise, and is almost perfect for my triangulation needs. One thing I found missing is that, when iterating over inner faces, I need to get their...
Hi! I needed to do CDT where I define the outer contour as a constraint (as well as zero or more inner cutouts). Adding constraints along the outer vertices didn't...
You sometimes represent a mesh with an array of vertices, and an array of triangle indices. I would construct such an array with something like: ``` let verts = triangulation.vertices().map(|pt|...
In some testing code, I found it useful to keep around a less-modified copy of a DelaunayTriangulation, and was surprised it isn't clone! This could be probably be added trivially?...
See #66. This is the initial implementation which works sufficiently well already. To use this, create a CDT, insert some constraint edges and then call `my_cdt.refine(RefinementParameters::new().exclude_outer_faces())` which will refine the...
It currently returns self.contains_any_constraint_edge(lineIntersectionIterator), which is true when the line intersects a constraint edge. In which case, one *cannot* add a constraint edge.
A lot of the time, when you call intersects_constraint, you're interested in which constraint you're intersecting, e.g. so you can get rid of it, or alter it, etc. Do you...
Is the implementation of „steiner points“ / insertion of additional points to reduce the triangle size to a certain maximum area planned for this library?
I use the [`glam`](https://docs.rs/crate/glam) crate in a project where I need to compute a delaunay triangulation. It would be nice to have a `HasPosition2D` implementation for the `glam` 2D vector...
