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
Polygon Triangulation
Triangulation Fundamentals
Definition of Triangulation
Properties of Triangulations
Diagonal Definition
Triangulation Existence
Applications
Mesh Generation
Computer Graphics
Finite Element Methods
Combinatorial Properties
Number of Triangulations
Catalan Numbers
Counting Triangulations
Dual Graphs
Art Gallery Problem
Problem Statement
Guard Placement
Visibility Concepts
Fisk's Theorem
Computational Complexity
Triangulating Monotone Polygons
Monotone Polygon Definition
Types of Monotonicity
y-Monotone
x-Monotone
Triangulation Algorithm
Stack-Based Approach
Diagonal Addition
Time Complexity
Correctness Proof
Polygon Partitioning
Partitioning into Monotone Pieces
Sweep-Line Approach
Helper Vertices
Diagonal Addition Strategy
Overall Triangulation Algorithm
Ear Clipping Method
Ear Definition
Ear Identification
Iterative Removal
Time Complexity
Optimal Triangulations
Weight Functions
Dynamic Programming Approach
Minimum Weight Triangulation
Previous
5. Line Segment Intersection
Go to top
Next
7. Proximity Problems