Useful Links
Mathematics
Computational Geometry
1. Introduction to Computational Geometry
2. Mathematical and Algorithmic Foundations
3. Fundamental Geometric Predicates
4. Convex Hulls
5. Line Segment Intersection
6. Polygon Triangulation
7. Proximity Problems
8. Geometric Data Structures and Searching
9. Arrangements and Duality
10. Motion Planning
11. Advanced Topics
Advanced Topics
Randomized Algorithms
Randomized Incremental Construction
General Framework
Backward Analysis
Expected Running Time
Applications
Convex Hulls
Delaunay Triangulations
Linear Programming
Derandomization Techniques
Las Vegas vs Monte Carlo
Approximation Algorithms
Approximation Schemes
PTAS
FPTAS
Coresets
Construction Methods
Clustering Approximations
k-Means
k-Center
Facility Location
High-Dimensional Geometry
Curse of Dimensionality
Volume Concentration
Distance Concentration
Nearest Neighbor Search
kd-Tree Limitations
Locality-Sensitive Hashing
Random Projections
Approximate Nearest Neighbor
Algorithms
Trade-offs
Quality Measures
Topological Methods
Simplicial Complexes
Construction
Homology
Persistent Homology
Filtrations
Persistence Diagrams
Barcodes
Stability Theorems
Applications
Shape Analysis
Data Analysis
Feature Detection
Parallel and GPU Algorithms
Parallel Computational Geometry
GPU-Based Algorithms
MapReduce Frameworks
Distributed Algorithms
Kinetic Data Structures
Moving Objects
Event-Driven Simulation
Kinetic Convex Hulls
Kinetic Nearest Neighbors
Geometric Optimization
Linear Programming
Simplex Method
Interior Point Methods
Quadratic Programming
Semidefinite Programming
Geometric Applications
Previous
10. Motion Planning
Go to top
Back to Start
1. Introduction to Computational Geometry