Part X · Computational Geometry and Advanced Algorithms
59. Advanced Computational Geometry
6 lessons•24 topics•Advanced / Expert
0 of 6 lessons published
59.01Outline
Advanced sweeps
- Bentley-Ottmann overview
- Segment intersection enumeration
- Event ordering
59.02Outline
Line/hull optimization
- Convex hull trick geometric view
- Half-plane intersection
- Line envelope
59.03Outline
Geometric data structures
- KD-tree
- Quadtree
- R-tree
- Spatial hashing
- Range trees
- Bounding volume hierarchies
59.04Outline
Voronoi/Delaunay
- Voronoi diagram
- Nearest site region
- Delaunay triangulation
- Duality overview
59.05Outline
Polygon algorithms
- Polygon clipping
- Triangulation
- Ear clipping
- Convex polygon intersection
59.06Outline
Higher dimensions
- Dot/cross limitations
- Distance in R^d
- Curse of dimensionality
- Convex hull in 3D overview