Error-bounded Point Cloud Compression Using Truncated Octahedron Quantization
Youyuan Liu, Longtao Zhang, Ruoyu Li, Bo Jiang, Taolue Yang, Kai Zhao, Sheng Di, Eduard Dragut, Sian Jin
Abstract
With the rapid advancement of large-scale scientific simulations, the massive volume of point cloud data generated has increasingly become a critical bottleneck for scientific storage systems and data management pipelines. Existing point cloud compression techniques integrated into scientific storage systems are designed for sparse geometry and rely on quantization schemes whose optimality assumptions do not hold for dense data. When applied at the compression layer to point clouds, this representation mismatch leads to fundamentally sub-optimal rate-distortion trade-offs that cannot be addressed through parameter tuning or framework-level adaptations. This mismatch increases storage overhead and limits efficient movement and downstream analysis of simulation outputs. This issue arises in scientific data management workflows handling large-scale dense particle datasets. State-of-the-art compression methods fail to fully exploit the redundancies inherent in such data. We address this limitation by developing a theory of point cloud compressibility for dense data, characterizing fundamental ratedistortion behavior at the representation layer. Guided by this analysis, we introduce XnYZip, an error-bounded lossy compressor based on provably optimal Truncated Octahedron quantization, combined with a locality-aware encoding pipeline using space-filling curves and run-length encoding. Experiments on large-scale scientific datasets demonstrate consistent storage and throughput improvements, achieving up to 3× higher compression ratios, 2.2× faster compression, and 1.2× faster decompression compared to state-of-the-art point cloud compressors under same distortion.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on13
- RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor SearchJianyang Gao, Cheng LongSIGMOD 2024 · 83 citations
- Decomposed Bounded Floats for Fast Compression and QueriesChunwei Liu, Hao Jiang, John Paparrizos, Aaron J. ElmoreVLDB 2021 · 65 citations
- ALP: Adaptive Lossless floating-Point CompressionAzim Afroozeh, Leonardo Kuffó, Peter BonczSIGMOD 2024 · 33 citations
- Improving Prediction-Based Lossy Compression Dramatically via Ratio-Quality ModelingSian Jin, Sheng Di, Jiannan Tian, Suren Byna et al.ICDE 2022 · 26 citations
- Toward Quantity-of-Interest Preserving Lossy Compression for Scientific DataPu Jiao, Sheng Di, Hanqi Guo, Kai Zhao et al.VLDB 2023 · 25 citations
Related papers
- LCP: Enhancing Scientific Data Management with Lossy Compression for ParticlesLongtao Zhang, Ruoyu Li, Congrong Ren, Sheng Di et al.SIGMOD 2025 · 6 citations
- Optimizing Error-Bounded Lossy Compression for Scientific Data by Dynamic Spline InterpolationKai Zhao, Sheng Di, Maxim Dmitriev, Thierry-Laurent D. Tonellot et al.ICDE 2021 · 151 citations
- TAC: Optimizing Error-Bounded Lossy Compression for Three-Dimensional Adaptive Mesh Refinement SimulationsDaoce Wang, Jesus Pulido, Pascal Grosset, Sian Jin et al.HPDC 2022 · 13 citations
- FZ-GPU: A Fast and High-Ratio Lossy Compressor for Scientific Computing Applications on GPUsBoyuan Zhang, Jiannan Tian, Sheng Di, Xiaodong Yu et al.HPDC 2023 · 27 citations
- TZ: Achieving High-Ratio Scientific Data Compression on GPUs with Global Data DecompositionZhuoxun Yang, Ruoyu Li, Amit N. Subrahmanya, Vishwas Rao et al.HPDC 2026
