# Slab Decomposition Point Location: Walkthrough
Slab Decomposition Point Location shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Draw vertical lines through every vertex, sort the edge fragments inside each slab, and binary-search the fragment that lies above a query.
## 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^2) space naively, O(log n) query; fractional cascading improves the space/query tradeoff.
## Common mistake
Not splitting an edge at every slab boundary, which lets a binary search compare the query against the wrong segment.
## 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 learn more.