3.4 Geometric Data Structures

KD-trees, R-trees, quadtrees, octrees, Delaunay triangulation, Voronoi diagrams, HNSW, range trees, and sweep line structures.

3.4 Geometric data structures, 40

index slug name
1 geometric-data-structure Geometric Data Structure
2 point-set Point Set
3 line-segment-set Line Segment Set
4 interval-tree-geometric Interval Tree
5 segment-tree-geometric Geometric Segment Tree
6 range-tree-geometric Range Tree
7 two-dimensional-range-tree-geometric 2D Range Tree
8 kd-tree KD Tree
9 kd-tree-nearest-neighbor KD Tree Nearest Neighbor
10 ball-tree Ball Tree
11 vp-tree Vantage Point Tree
12 cover-tree Cover Tree
13 quadtree Quadtree
14 octree Octree
15 r-tree R Tree
16 r-star-tree R Star Tree
17 hilbert-r-tree Hilbert R Tree
18 bounding-volume-hierarchy Bounding Volume Hierarchy
19 spatial-hash Spatial Hash
20 uniform-grid Uniform Grid
21 compressed-quadtree Compressed Quadtree
22 point-location-structure Point Location Structure
23 planar-subdivision Planar Subdivision
24 dc-el Doubly Connected Edge List
25 half-edge-mesh Half Edge Mesh
26 winged-edge-structure Winged Edge Structure
27 delaunay-triangulation Delaunay Triangulation
28 voronoi-diagram Voronoi Diagram
29 convex-hull-structure Convex Hull Structure
30 dynamic-convex-hull Dynamic Convex Hull
31 nearest-neighbor-index Nearest Neighbor Index
32 approximate-nearest-neighbor Approximate Nearest Neighbor
33 locality-sensitive-hashing Locality Sensitive Hashing
34 hnsw HNSW
35 range-search-structure Range Search Structure
36 rectangle-intersection Rectangle Intersection
37 sweep-line-status Sweep Line Status
38 geometric-invariant-check Geometric Invariant Check
39 geometric-memory-layout Geometric Memory Layout
40 geometric-benchmarking Geometric Benchmarking