UsefulLinks
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
3.
Fundamental Geometric Predicates
3.1.
Orientation Test
3.1.1.
Geometric Interpretation
3.1.2.
Cross Product Method
3.1.3.
Determinant Method
3.1.4.
Signed Area Computation
3.1.5.
Applications
3.1.5.1.
Convex Hull Construction
3.1.5.2.
Polygon Testing
3.1.5.3.
Line Intersection
3.2.
In-Circle Test
3.2.1.
Geometric Interpretation
3.2.2.
Determinant Method
3.2.3.
Algebraic Formulation
3.2.4.
Applications
3.2.4.1.
Delaunay Triangulation
3.2.4.2.
Voronoi Diagrams
3.3.
Point-in-Polygon Test
3.3.1.
Ray Casting Algorithm
3.3.2.
Winding Number Method
3.3.3.
Crossing Number Method
3.3.4.
Handling Edge Cases
3.4.
Robustness and Numerical Issues
3.4.1.
Floating-Point Precision Problems
3.4.1.1.
Rounding Errors
3.4.1.2.
Catastrophic Cancellation
3.4.1.3.
Overflow and Underflow
3.4.2.
Exact Arithmetic Methods
3.4.2.1.
Rational Arithmetic
3.4.2.2.
Interval Arithmetic
3.4.2.3.
Adaptive Precision
3.4.3.
Symbolic Perturbation
3.4.3.1.
Simulation of Simplicity
3.4.3.2.
Lexicographic Ordering
3.4.4.
Handling Degenerate Cases
3.4.4.1.
Collinear Points
3.4.4.2.
Cocircular Points
3.4.4.3.
Overlapping Objects
Previous
2. Mathematical and Algorithmic Foundations
Go to top
Next
4. Convex Hulls