more tweak

This commit is contained in:
joe 2026-01-21 22:57:44 -08:00
parent 24b7709b4c
commit c9bab10f6b

View file

@ -5,9 +5,7 @@ use bevy::{
use crate::geom::Point;
/// An entry in the R*tree, which can be either a leaf or a node.
#[derive(Debug, Clone)]
pub enum Entry {
Leaf { mbr: Aabb2d, object: Point },
Node { mbr: Aabb2d, child: TreeNode },
@ -22,20 +20,12 @@ impl Entry {
}
}
/// A node in the R*tree.
#[derive(Debug, Clone)]
pub struct TreeNode {
/// The entries stored in this node.
pub entries: Vec<Entry>,
/// Indicates whether this node is a leaf.
pub is_leaf: bool,
}
/// R*tree data structure for indexing 2D or 3D points.
///
/// The tree is initialized with a maximum number of entries per node. If a node
/// exceeds this number, it will split. The tree supports insertion, deletion,
/// and range searches.
#[derive(Debug, Clone)]
pub struct RStarTree {
root: TreeNode,