mlsanityData to 14 Oct 2026

Error-bounded Point Cloud Compression Using Truncated Octahedron Quantization

arXiv 2608.00495 ↗First posted 1 Aug 2026cs.PF cs.DB cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

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 rate-distortion 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 3x higher compression ratios, 2.2x faster compression, and 1.2x faster decompression compared to state-of-the-art point cloud compressors under same distortion.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 65 references that are in the map. First posted on arXiv 1 Aug 2026.

Builds on

6 of 65 references.

References · 6

  1. 2016A Point Set Generation Network for 3D Object Reconstruction from a Single Imagecited by 979
  2. 2024RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Searchcited by 48
  3. 2024LCP: Enhancing Scientific Data Management with Lossy Compression for Particlescited by 3
  4. 2024QPET: A Versatile and Portable Quantity-of-Interest-Preservation Framework for Error-Bounded Lossy Compressioncited by 2
  5. 2025Time-varying Vector Field Compression with Preserved Critical Point Trajectoriescited by 2
  6. 2022TAC: Optimizing Error-Bounded Lossy Compression for Three-Dimensional Adaptive Mesh Refinement Simulationscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Mitigating Artifacts in Pre-quantization Based Scientific Data Compressors with Quantization-aware Interpolation
  2. 2024Lessons Learned on the Path to Guaranteeing the Error Bound in Lossy Quantizers
  3. 2023Black-Box Statistical Prediction of Lossy Compression Ratios for Scientific Data
  4. 2026Octree-based Learned Point Cloud Geometry Compression: A Lossy Perspective
  5. 2023FZ-GPU: A Fast and High-Ratio Lossy Compressor for Scientific Computing Applications on GPUs
  6. 2022SIMD Lossy Compression for Scientific Data
  7. 2025A General Error-Theoretical Analysis Framework for Constructing Compression Strategies
  8. 2025LLMComp: A Language Modeling Paradigm for Error-Bounded Scientific Data Compression (Technical Report)