|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
QuadTree node implementation for spatial data structures. More...
Go to the source code of this file.
Classes | |
| class | QuadNode |
| Node for QuadTree spatial data structure. More... | |
Macros | |
| #define | PARENT(p) ((p)->get_parent()) |
| #define | NW_CHILD(p) ((p)->get_nw_child()) |
| #define | NE_CHILD(p) ((p)->get_ne_child()) |
| #define | SW_CHILD(p) ((p)->get_sw_child()) |
| #define | SE_CHILD(p) ((p)->get_se_child()) |
| #define | COLOR(p) ((p)->get_color()) |
| #define | LEVEL(p) ((p)->get_level()) |
QuadTree node implementation for spatial data structures.
This file provides QuadNode, a node class for quadtree spatial indexing. Each node represents a rectangular region and can be subdivided into four quadrants (NW, NE, SW, SE) for efficient 2D point storage and queries.
Definition in file quadnode.H.
| #define COLOR | ( | p | ) | ((p)->get_color()) |
Definition at line 58 of file quadnode.H.
| #define LEVEL | ( | p | ) | ((p)->get_level()) |
Definition at line 59 of file quadnode.H.
| #define NE_CHILD | ( | p | ) | ((p)->get_ne_child()) |
Definition at line 55 of file quadnode.H.
| #define NW_CHILD | ( | p | ) | ((p)->get_nw_child()) |
Definition at line 54 of file quadnode.H.
| #define PARENT | ( | p | ) | ((p)->get_parent()) |
Definition at line 53 of file quadnode.H.
| #define SE_CHILD | ( | p | ) | ((p)->get_se_child()) |
Definition at line 57 of file quadnode.H.
| #define SW_CHILD | ( | p | ) | ((p)->get_sw_child()) |
Definition at line 56 of file quadnode.H.