# Delaunay Triangulation From Dual: Explained
Delaunay Triangulation From Dual shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The Delaunay triangulation is the dual of the Voronoi diagram: connect sites whose Voronoi cells share an edge, equivalently triangles with empty circumcircles.
## 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 log n) via Fortune or randomized incremental flip.
## Common mistake
Accepting a triangle whose circumcircle contains another site, which is not Delaunay.
## 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 Linkjob.ai.