Common Subtree Merging Compressed Opacity Micromaps 50

Alpha masked geometry is very prevalent in 3D scenes. It is commonly used to express complex shapes while limiting the need for additional polygonal geometry. A predominant use case is foliage rendering, where leaves often have complex and curved edges with fine detail. Opacity micromaps (OMMs) provide a substantial improvement to ray tracing alpha masked geometry. We present a novel method of lossless compression for opacity micromaps using common subtree merging that supports real-time random access without decompression. We demonstrate reductions in memory usage of up to two orders of magnitude compared to standard OMMs, with similar rendering performance. Our method includes aggregate hierarchical opacity for OMMs. With it, we can estimate the opacity at intermediate levels of detail, making it possible to reduce aliasing from fine detail. Further, we demonstrate that our compression can be applied to binary alpha mask textures, requiring as little as 0.05 bits per texel.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Computer Graphics and Interactive Techniques
Published
2026-06-29
DOI
https://doi.org/10.1145/3820017
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Common Subtree Merging Compressed Opacity Micromaps 50

Markus Billeter, Jaina Modisett, Thomas Chernaik
Proceedings of the ACM on Computer Graphics and Interactive Techniques
Computer Graphics and Visualization Techniques
article

Common Subtree Merging Compressed Opacity Micromaps 50

Markus Billeter, Jaina Modisett, Thomas Chernaik
article en

Abstract

Alpha masked geometry is very prevalent in 3D scenes. It is commonly used to express complex shapes while limiting the need for additional polygonal geometry. A predominant use case is foliage rendering, where leaves often have complex and curved edges with fine detail. Opacity micromaps (OMMs) provide a substantial improvement to ray tracing alpha masked geometry. We present a novel method of lossless compression for opacity micromaps using common subtree merging that supports real-time random access without decompression. We demonstrate reductions in memory usage of up to two orders of magnitude compared to standard OMMs, with similar rendering performance. Our method includes aggregate hierarchical opacity for OMMs. With it, we can estimate the opacity at intermediate levels of detail, making it possible to reduce aliasing from fine detail. Further, we demonstrate that our compression can be applied to binary alpha mask textures, requiring as little as 0.05 bits per texel.

Proceedings of the ACM on Computer Graphics and Interactive TechniquesVol. 9(4)
University of Leeds (GB)
Engineering and Physical Sciences Research Council
Openalex Percentile: Top 3%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Common Subtree Merging Compressed Opacity Micromaps 50 — Markus Billeter, Jaina Modisett, et al. · Proceedings of the ACM on Computer Graphics and Interactive Techniques (2026) | TGRS Research Map | TGRS