scirs2_spatial/rtree/
mod.rs

1//! R-tree implementation for efficient spatial indexing
2//!
3//! This module provides an implementation of the R-tree data structure
4//! for efficient spatial indexing and querying in 2D and higher dimensional spaces.
5//!
6//! R-trees are tree data structures used for spatial access methods that group
7//! nearby objects and represent them with minimum bounding rectangles (MBRs)
8//! in the next higher level of the tree. They are useful for spatial databases,
9//! GIS systems, and other applications involving multidimensional data.
10//!
11//! This implementation supports:
12//! - Insertion and deletion of data points
13//! - Range queries
14//! - Nearest neighbor queries
15//! - Spatial joins
16
17mod deletion;
18mod insertion;
19mod node;
20mod optimization;
21mod query;
22
23// Re-export all public components from submodules
24pub use node::{RTree, Rectangle};
25
26// Imports used across modules
27// Module uses individual imports in submodules
28
29// Module-wide common type definitions and helper functions can go here
scirs2_spatial/rtree/mod.rs

scirs2_spatial/rtree/
mod.rs
