December 25, 2025
Glassgate: who sorts transparency?
Geometric Algorithms for Translucency Sorting in Minecraft [pdf]
Minecraft’s glass war: old-school Quake tricks vs modern GPU magic
TLDR: A thesis adds a faster method to draw see‑through blocks in Minecraft’s Sodium mod, promising cleaner visuals. Comments explode into a retro vs modern showdown: classic DOOM/Quake BSP versus GPU‑powered transparency, with link drops and bragging rights over the best way to make glass look right.
A master’s thesis just tried to fix Minecraft’s eternal see‑through chaos—think glass panes, water, and fog awkwardly overlapping—by smartly ordering what gets drawn first. Implemented in the performance mod Sodium, the work claims a 60% faster way to sort translucent stuff than the usual “closest first” approach. Cue the community: link flexing, retro throwbacks, and a full-on glass war. jacobp100 drops a humble “I did something like this” blog, while ANighRaisin rolls in with a mic‑drop: DOOM and Quake already solved this with Binary Space Partitioning—back when your PC had the power of a toaster.
Then the GPU crowd crashes the party. NotGMan cites the “per‑pixel linked list” trick and Order‑Independent Transparency (OIT), basically letting the graphics card juggle all the glass layers for you. The drama: brainy pre‑sorting versus brute‑force GPU magic. Some cheer the thesis for being practical in Minecraft’s blocky world; others want modern graphics wizardry everywhere. Memes fly: “Finally my aquarium won’t flicker,” “Quake veterans assembling BSP like it’s 1996,” and “Sodium users praying for smooth glass.” In short, the community turned a nerdy paper into a spirited showdown over how to make Minecraft’s translucency look right—and fast.
Key Points
- •The thesis implements quad-based translucency sorting in the Sodium mod for Minecraft.
- •A visibility-graph topological sort can produce correct orders but has quadratic runtime and risks failure when approximated, making it suitable for static sorting.
- •Axis-aligned multi-partition trees built via projected interval scanning enable dynamic sorting without quad fragmentation.
- •The dynamic sorting using multi-partition trees is 60% faster than distance-based sorting.
- •Unaligned partitioning offers theoretical insights (polynomial upper bound, lower bounds from linear optimization) but is not necessary for Minecraft.