refactor!: flatten triangulation modules into focused APIs

.github/workflows/benchmarks.yml

@@ -42,7 +42,7 @@ concurrency:
 env:
   CARGO_TERM_COLOR: always
   RUST_BACKTRACE: 1
-  UV_VERSION: "0.11.14"
+  UV_VERSION: "0.11.15"
   BENCHMARK_TIMEOUT: 1800 # 30 min; pre-computed seeds + reduced 5D counts keep runtime well under this
   DELAUNAY_BENCH_DISCOVER_SEEDS_LIMIT: 256 # fallback only; ci_performance_suite uses pre-computed seeds
 

.github/workflows/ci.yml

@@ -24,14 +24,14 @@ env:
   ACTIONLINT_VERSION: "1.7.12"
   DPRINT_VERSION: "0.54.0"
   JUST_VERSION: "1.51.0"
-  RUMDL_VERSION: "0.1.93"
+  RUMDL_VERSION: "0.1.94"
   SHFMT_VERSION: "3.13.1"
   SHFMT_SHA256_DARWIN_AMD64: "6feedafc72915794163114f512348e2437d080d0047ef8b8fa2ec63b575f12af"
   SHFMT_SHA256_DARWIN_ARM64: "9680526be4a66ea1ffe988ed08af58e1400fe1e4f4aef5bd88b20bb9b3da33f8"
   SHFMT_SHA256_LINUX_AMD64: "fb096c5d1ac6beabbdbaa2874d025badb03ee07929f0c9ff67563ce8c75398b1"
   TAPLO_VERSION: "0.10.0"
   TYPOS_VERSION: "1.46.1"
-  UV_VERSION: "0.11.14"
+  UV_VERSION: "0.11.15"
 
 jobs:
   build:

.github/workflows/generate-baseline.yml

@@ -34,7 +34,7 @@ permissions:
 env:
   CARGO_TERM_COLOR: always
   RUST_BACKTRACE: 1
-  UV_VERSION: "0.11.14"
+  UV_VERSION: "0.11.15"
   # Seed search limit for both old (pre-v0.8) and current env var names.
   # Old tags read DELAUNAY_BENCH_SEED_SEARCH_LIMIT; current code reads
   # DELAUNAY_BENCH_DISCOVER_SEEDS_LIMIT. Setting both ensures backward

.github/workflows/semgrep-sarif.yml

@@ -24,7 +24,7 @@ permissions:
   actions: read
 
 env:
-  UV_VERSION: "0.11.14"
+  UV_VERSION: "0.11.15"
 
 jobs:
   semgrep-sarif:

README.md

@@ -172,16 +172,16 @@ Choose the smallest prelude that matches the task:
 
 | Task | Import |
 |---|---|
-| Construct/configure a Delaunay triangulation | `use delaunay::prelude::triangulation::construction::*` |
+| Construct/configure a Delaunay triangulation | `use delaunay::prelude::construction::*` |
 | Read-only traversal, adjacency, convex hulls, and comparison helpers | `use delaunay::prelude::query::*` |
 | Points, kernels, predicates, and geometric measures | `use delaunay::prelude::geometry::*` |
 | Random points or triangulations for examples, tests, and benchmarks | `use delaunay::prelude::generators::*` |
-| Low-level incremental insertion building blocks | `use delaunay::prelude::triangulation::insertion::*` |
-| Bistellar flips / Edit API | `use delaunay::prelude::triangulation::flips::*` |
-| Delaunay repair diagnostics and policies | `use delaunay::prelude::triangulation::repair::*` |
-| Delaunayize workflow | `use delaunay::prelude::triangulation::delaunayize::*` |
-| Construction telemetry diagnostics | `use delaunay::prelude::triangulation::diagnostics::*` |
-| Construction validation cadence/policy | `use delaunay::prelude::triangulation::validation::*` |
+| Low-level incremental insertion building blocks | `use delaunay::prelude::insertion::*` |
+| Bistellar flips / Edit API | `use delaunay::prelude::flips::*` |
+| Delaunay repair diagnostics and policies | `use delaunay::prelude::repair::*` |
+| Delaunayize workflow | `use delaunay::prelude::delaunayize::*` |
+| Construction telemetry diagnostics | `use delaunay::prelude::diagnostics::*` |
+| Construction validation cadence/policy | `use delaunay::prelude::validation::*` |
 | Hilbert ordering and quantization utilities | `use delaunay::prelude::ordering::*` |
 | Low-level TDS simplices, facets, keys, and validation reports | `use delaunay::prelude::tds::*` |
 | Collection aliases and small buffers | `use delaunay::prelude::collections::*` |
@@ -190,7 +190,7 @@ Choose the smallest prelude that matches the task:
 
 `use delaunay::prelude::*` remains available for quick experiments, but examples
 and benchmarks in this repository prefer focused preludes so imports document
-intent. The broad `delaunay::prelude::triangulation::*` import is retained for
+intent. The broad `delaunay::prelude::*` import is retained for
 compatibility, but new docs and tests should prefer the narrow workflow preludes
 above.
 
@@ -203,7 +203,7 @@ preludes. Contributors should follow the namespace policy in
 [CONTRIBUTING.md](CONTRIBUTING.md) and [docs/code_organization.md](docs/code_organization.md).
 
 ```rust
-use delaunay::prelude::triangulation::construction::{
+use delaunay::prelude::construction::{
     DelaunayTriangulationBuilder, DelaunayTriangulationConstructionError, vertex,
 };
 
@@ -235,7 +235,7 @@ fn main() -> Result<(), DelaunayTriangulationConstructionError> {
 For periodic boundary conditions, use `DelaunayTriangulationBuilder`:
 
 ```rust
-use delaunay::prelude::triangulation::construction::{
+use delaunay::prelude::construction::{
     DelaunayTriangulationBuilder, DelaunayTriangulationConstructionError, TopologyKind, vertex,
 };
 
@@ -313,11 +313,11 @@ regression testing:
   `ValidationPolicy`
 
 ```rust
-use delaunay::prelude::triangulation::construction::{
+use delaunay::prelude::construction::{
     ConstructionOptions, DedupPolicy, DelaunayTriangulationBuilder, InsertionOrderStrategy,
     RetryPolicy, TopologyGuarantee, vertex,
 };
-use delaunay::prelude::triangulation::validation::ValidationPolicy;
+use delaunay::prelude::validation::ValidationPolicy;
 
 let vertices = vec![
     vertex!([0.0, 0.0]),
@@ -356,7 +356,7 @@ For reproducible checks in CI/local runs, use `just check`, `just test`,
 - **Large 4D+ batches:** thousands of 4D points can be expensive to
   investigate. Use release mode and the large-scale debug harness for
   characterization.
-- **3D scale:** the default `just debug-large-scale-3d` helper uses 8,000
+- **3D scale:** the default `just debug-large-scale-3d` helper uses 7,500
   vertices for the near-one-minute acceptance path. The 10,000-vertex run has
   also passed full Levels 1–4 validation as a heavier characterization probe;
   use `just debug-large-scale-3d 10000 1` for local numbers.
@@ -549,4 +549,4 @@ Portions of this library were developed with the assistance of these AI tools:
 [PL-manifold]: https://en.wikipedia.org/wiki/Piecewise_linear_manifold
 [Delaunay repair]: https://link.springer.com/article/10.1007/BF01975867
 [Pachner moves]: https://en.wikipedia.org/wiki/Pachner_move
-[`DelaunayTriangulationBuilder`]: https://docs.rs/delaunay/latest/delaunay/triangulation/builder/struct.DelaunayTriangulationBuilder.html
+[`DelaunayTriangulationBuilder`]: https://docs.rs/delaunay/latest/delaunay/builder/struct.DelaunayTriangulationBuilder.html

REFERENCES.md

@@ -29,6 +29,21 @@ Zenodo. DOI: https://doi.org/10.5281/zenodo.16931097
 For BibTeX, APA, or other citation formats, please refer to the [CITATION.cff](CITATION.cff) file or use
 GitHub's "Cite this repository" feature.
 
+## Inline Citation Keys
+
+Some Rust API docs use compact numbered citations. The labels below point to
+the corresponding bibliography entries in this file:
+
+- [1] Shewchuk, J. R. (1997), adaptive precision floating-point arithmetic and
+  robust geometric predicates.
+- [2] Bowyer, A. (1981), incremental Dirichlet/Delaunay tessellation.
+- [3] Watson, D. F. (1981), n-dimensional Delaunay tessellation by cavity
+  replacement.
+- [4] Edelsbrunner, H., and Shah, N. R. (1996), topological flipping for
+  regular triangulations.
+- [5] Edelsbrunner, H. (2001), mesh generation, cavity-based construction, and
+  triangulation repair background.
+
 ## Advanced Computational Geometry Topics
 
 These references support specialized features and high-dimensional computations in the library.