All notable changes to this project will be documented in this file.
The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.
0.8.2 - 2024-10-07
- fix bug where
collect_garbage()could make further insertion panic
0.8.1 - 2024-09-30
- fix bug with Laplace/NNI interpolation when interpolate same location
0.8.0 - 2024-07-16
- vertices of the DT can now have attributes attached to them, just a JSON dict (a serde Value is used). You need to define a schema first. It's probably easier to use in Python, integrated with NumPy to some extent
- xy-duplicates are now handled and the behaviour can be configured. In previous versions, it was first-come-first-served, but now these 4 options are possible: First/Last/Highest/Lowest (First==default). This means that if a new vertex is an xy-duplicate (based on
dt.snap_tolerance), the z value kept is depending on the configuration (the same is done if extra attributes are stored for the vertex). - added functions calculate area2d/3d and volume of triangles, due to popular demand
- many bugs were fixed, eg PLY output is now valid and outputs all extra attributes, the CityJSON output now correctly omits the infinity vertex, if removed() created a non-initialised DT then it doesn't panic anymore
- fix a bug where function
adjacent_triangles_to_triangle()returned only the finite triangles, while all (incl. infinite) should be returned - more recent crate "robust" is used
0.7.0 - 2023-08-16
- interpolate methods are now in a separate module and thus the way to call them is totally different. Not backwards compatible either, see
/examples/interpol.rsfor how to use them. - IDW was added to the list of interpolation, the simplest version with a search radius.
- functions are now clearer:
all_triangles()andall_finite_triangles() - a few bugs were fixed, related to functions used before the triangulation was initialised.
- the export to GeoJSON was removed in order to keep the dependencies of the library as little as possible. The Python bindings now have that function, you can fetch the code if you need to do this (https://github.com/hugoledoux/startinpy/blob/develop/src/lib.rs#L762)
0.6.2 - 2023-01-04
- interpolate_nni() is now faster and better and more stable: the unbounded Voronoi cells are not bounded anymore, instead a trick is used to calculate a fake area and then since the trick is used twice (and values subtracted) then everything cancels out.
- fixed a bug when remove() meant that the DT was formed of only collinear points. Thanks @OliverJPost for finding that bug.
0.6.1 - 2022-09-28
- collect_garbage() to remove from memory/array the vertices/stars marked as to be removed
- has_garbage() to know if above should be used
- insert() with BBow now performs automatically collect_garbage(), otherwise one had 4 vertices they never seen there in the array and that was problematic
0.6.0 - 2022-09-20
- get_bbox() function, an AABB one that is
- insert() now as insertion strategies: as is (order given is inserted), and BBox where a square containing all points is first inserted (and deleted at the end), this speeds up points in raster runlength order a lot.
- a few functions added to c_api
- export to PLY format
- a Point is not a Vec anymore, but an array [f64;3]. If you want 2D, add 0.0 as z-value for your points.
- fixed some minor bugs, eg with the OBJ export when points had been deleted
- uses now Rust 2021
- most functions now return a Result if something outside the convexhull is done or if a vertex ID doesn't exist, and
StartinErrorare defined: VertexUnknown, VertexRemoved, VertexInfinite, TriangleNotPresent, OutsideConvexHull, NoTriangleinTIN, - docs was improved
- added wrapper in c_api around some interpolation functions
- changed slightly the c_api with better return types
- fixed a bug that returned the wrong nearest neighbour (and thus wrong interpolate_nn() results)
- improve the geojson output, now the id+z of the vertices are saved
- fixed a small bug that arised sometimes when deleting a vertex on the convex hull
- interplation with natural neighbour (nni, or Sibson's method) is added.
- saving of the triangulation to GeoJSON is added
- Delete the robust arithmetic code copied from spades, and use Rust crate "robust"
- interpolation functions are more robust (if no DT exists, if estimation at known vertex)
- Added basic C interface, so startin can be called from other languages (such as C or Julia). Build with
cargo build --features c_api.
- Fix a small bug in walk, that seemed to have no real effect (except slowly down a bit)
- Fix the bug about predicates.rs raised by Martijn Meijers (Stoeoef/spade#48)
- 3 interpolation functions, based on the DT, added: nearest-neighbour, linear in TIN, Laplace.
- fixed a bug with walking that sometimes crashed when point outside convex hull were inserted
- the OBJ writer is now about 1283X faster
- closest_vertex() is now returning the real natural neighbour, and not an approximation
- fixed a few bugs, most important is when walking when starting vertex was infinity vertex, now no crash
all_edges()function to draw faster, used by startin_wasm project
- minor improvements to the API, alignment with CGAL SurfaceMesh functions (more or less)
- better doc
- predicates.c is not used anymore. The Rust port of it (https://github.com/Stoeoef/spade/blob/master/src/exactpred.rs) is used.
- dependencies for the examples are not used/listed for the library anymore.
- predicates.c has sys removed from include for time.h
- jump-and-walk is not the default anymore, walk starts from last one (no randomness by default thus)
- Deletion of vertices now possible, even those on the boundary of the convex hull
- Integration tests available in the /tests/ folder
- more examples
- fix of readme.md and a few things for crates.io
- first release and upload to crates.io