v0.1.1
DelaunayTriangulation v0.1.1
Closed issues:
- Fix triangulation in the presence of collinear points (#6)
- Overhead in using new points (#9)
- Move away from specific geometric types and just require a specific set of methods (#10)
- Method for adding ghost triangles into an already computed triangulation (#13)
- Method for removing ghost triangles from a triangulation (#14)
- Put 0 into the DelaunayGraph for triangulations computed using de Berg's method (#15)
- Convex hull (#16)
- Voronoi tessellation (#17)
- Bowyer-Watson fails with collinear points (#18)
- Do some testing for point location in the presence of collinear points (#19)
- de Berg fails in this example (#21)
- Add option for skipping points (#22)
- TagBot trigger issue (#27)
- Check for duplicate points (#28)
- Make the extraction of the convex hull more efficient with ghost triangles (#29)
Merged pull requests:
- CompatHelper: add new compat entry for DataStructures at version 0.18, (keep existing compat) (#11) (@github-actions[bot])