Reworks locate algorithm.

CHANGELOG.md

@@ -5,6 +5,17 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](http://keepachangelog.com/)
 and this project adheres to [Semantic Versioning](http://semver.org/).
 
+## [2.10.0] - 2024-07-25
+
+### Added
+
+- Added basic `mint` support via the `mint` feature
+- Implements `Triangulation::get_vertex(FixedVertexHandle)` (See #106)
+
+### Fix
+
+- Fixes potential crash when inserting / locating vertices (See #107)
+
 ## [2.9.0] - 2024-06-14
 
 ### Added
@@ -436,7 +447,9 @@ A lot has changed for the 1.0. release, only larger changes are shown.
 
 Initial commit
 
-[2.8.0]: https://github.com/Stoeoef/spade/compare/v2.8.0...v2.9.0
+[2.10.0]: https://github.com/Stoeoef/spade/compare/v2.9.0...v2.10.0
+
+[2.9.0]: https://github.com/Stoeoef/spade/compare/v2.8.0...v2.9.0
 
 [2.8.0]: https://github.com/Stoeoef/spade/compare/v2.7.0...v2.8.0
 

Cargo.toml

@@ -31,6 +31,12 @@ version = "1.0.0"
 default-features = false
 features = ["derive", "alloc"]
 
+[dependencies.mint]
+package = "mint"
+optional = true
+default-features = false
+version = "0.5.9"
+
 [workspace]
 members = ["delaunay_compare"]
 
@@ -50,3 +56,6 @@ shapefile = "0.6.0"
 [[bench]]
 name = "benchmarks"
 harness = false
+
+[lints.rust]
+unexpected_cfgs = { level = "warn", check-cfg = ['cfg(fuzzing)'] }

src/cdt.rs

@@ -1706,6 +1706,37 @@ mod test {
         Ok(())
     }
 
+    #[test]
+    pub fn infinite_loop_2() -> Result<(), InsertionError> {
+        let lines = [
+            [
+                Point2::new(0.9296344883099084, 0.03071359966930065),
+                Point2::new(0.26031306872107085, 0.34491289915959455),
+            ],
+            [
+                Point2::new(0.7384289920396423, 0.4981747664368982),
+                Point2::new(0.06543525273452533, 0.34139896206401854),
+            ],
+            [
+                Point2::new(0.9535295221136963, 0.9114305148801416),
+                Point2::new(0.8306091165247367, 0.08959389670590667),
+            ],
+        ];
+
+        let mut cdt = ConstrainedDelaunayTriangulation::<Point2<f64>>::new();
+
+        for [a, b] in lines {
+            let a = cdt.insert(a)?;
+            let b = cdt.insert(b)?;
+
+            cdt.add_constraint_and_split(a, b, |v| v);
+        }
+
+        // This insertion used to fail as the position could not be located
+        cdt.insert(Point2::new(0.5138795569454557, 0.3186272217036502))?;
+        Ok(())
+    }
+
     fn get_cdt_for_try_add_constraint() -> Result<Cdt, InsertionError> {
         let vertices = vec![
             Point2::new(0.0, -10.0),

src/delaunay_core/bulk_load.rs

@@ -339,7 +339,7 @@ where
     None
 }
 
-pub struct PointWithIndex<V> {
+pub(crate) struct PointWithIndex<V> {
     data: V,
     index: usize,
 }

src/delaunay_core/dcel.rs

@@ -133,6 +133,10 @@ impl<V, DE, UE, F> Dcel<V, DE, UE, F> {
         self.faces.truncate(1); // Keep outer face
     }
 
+    pub fn get_vertex(&self, handle: FixedVertexHandle) -> Option<VertexHandle<V, DE, UE, F>> {
+        (handle.index() < self.vertices.len()).then(|| self.vertex(handle))
+    }
+
     pub fn map_vertices<M, V2>(self, f: M) -> Dcel<V2, DE, UE, F>
     where
         M: Fn(V) -> V2,