Quadtree partitioning is the technique HEVC and similar codecs use to recursively split larger blocks into smaller ones. Start with a 64×64 CTU. The encoder asks: "is this CTU best coded as one big block, or should I split it into four 32×32 sub-blocks?" If split, each 32×32 sub-block recursively faces the same question: split into four 16×16, or keep as one? The recursion continues down to 8×8 or 4×4. The final pattern is a quadtree — each node has either zero or four children — and represents the encoder's content-adaptive partition of the frame.

The benefit is detail-aware coding. Large flat regions (sky, walls, out-of-focus backgrounds) end up as single 64×64 blocks — minimal header overhead, efficient transform, compresses to almost nothing. Detailed regions (eyes, hair, text) end up as many tiny 4×4 or 8×8 blocks — higher overhead per block but accurate detail capture where the eye actually looks. The encoder picks the split level per region using rdo (rate-distortion optimisation) — it tries different splits and keeps the one with the best quality-versus-size trade-off.

For a product team, quadtree partitioning is invisible plumbing that explains a big chunk of HEVC's efficiency win over H.264. H.264 had fixed 16×16 macroblocks; HEVC's quadtree splits to whatever the content demands, and that flexibility alone delivers ~15–20 % of the efficiency gain. AV1 extends quadtree further with non-square partitions (a 64×64 block can split into two 32×64 rectangles instead of four 32×32 squares), and VVC goes further still. Each level of flexibility costs encoder compute but saves bits in the bitstream.

Book cover: Video Encoding, Volume 1 of the Fora Soft Video Engineering Handbook

The book · Volume 1 of 7

Video Encoding: A Complete Guide to Video Compression — From Pixels and Color to H.264, HEVC, AV1, Quality Metrics, and AI

Quadtree partitioning lets the encoder use large blocks on flat areas and small ones on detail, and it drives much of HEVC's gain over H.264. Volume 1 covers quadtree partitioning in detail: coding tree units, recursive splits, AV1's rectangular and ternary partitions, and the encode-time cost of searching them. Written by Nikolay Sapunov, CEO at Fora Soft.

Read it on Amazon →Kindle & paperback · Fora Soft Video Engineering Handbook

Weighing HEVC or AV1 encode time against the compression their partitioning brings?

Share your content and encoding budget: we test partition search settings and show the speed versus bitrate trade-off for your workloads. 250+ video products shipped since 2005.

Book a 30-min call →WhatsApp →Email us →