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
Fundamental Geometric Predicates
Orientation Test
Geometric Interpretation
Cross Product Method
Determinant Method
Signed Area Computation
Applications
Convex Hull Construction
Polygon Testing
Line Intersection
In-Circle Test
Geometric Interpretation
Determinant Method
Algebraic Formulation
Applications
Delaunay Triangulation
Voronoi Diagrams
Point-in-Polygon Test
Ray Casting Algorithm
Winding Number Method
Crossing Number Method
Handling Edge Cases
Robustness and Numerical Issues
Floating-Point Precision Problems
Rounding Errors
Catastrophic Cancellation
Overflow and Underflow
Exact Arithmetic Methods
Rational Arithmetic
Interval Arithmetic
Adaptive Precision
Symbolic Perturbation
Simulation of Simplicity
Lexicographic Ordering
Handling Degenerate Cases
Collinear Points
Cocircular Points
Overlapping Objects
Previous
2. Mathematical and Algorithmic Foundations
Go to top
Next
4. Convex Hulls