# Bowyer Watson Delaunay Insert: Interview Notes

Bowyer Watson Delaunay Insert shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Find every triangle whose circumcircle contains the new point, delete that cavity, and retessellate it by joining the point to the cavity boundary.

## 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

Expected O(n log n) for random sites in the plane; worst-case O(n^2).

## Common mistake

Leaving a triangle whose circumcircle contains the new point, which produces a non-Delaunay edge.

## 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 assistant.