# Chazelle Linear Triangulation: Practice Notes

Chazelle Linear Triangulation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Use a hierarchy of graphs and a coordinated search to triangulate a simple polygon in linear time, avoiding the random sampling of Seidel's method.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) worst-case for a simple polygon.

## Common mistake

Treating a polygonal hole as if it were an outer boundary, which the linear-time algorithm does not accept without a separate reduction.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview helper that uses your resume.