- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Context-based Lattice Compression (CLC), a framework for compressing large-scale lattice structures while preserving high geometric fidelity and lossless graph connectivity. The method employs multi-resolution hash embeddings to represent node coordinates, radii, and edge connectivity. Learned context models are used to estimate the probability distributions of hash embeddings and geometric residuals for entropy coding. For topology reconstruction, the method predicts edge connectivity from candidate edges and explicitly encodes correction edges to recover the original topology.
The authors further introduce feature pruning and hash fusion to improve compression efficiency. Experiments on three procedurally generated lattice datasets demonstrate improved compression ratios compared with existing baselines while maintaining low geometric reconstruction errors and exact topology recovery.
Critical strengths
S1. Effective Compression with High Geometric Fidelity and Exact Topology Recovery.
The method demonstrates strong compression performance on the evaluated datasets. In particular, CLC reduces the Tetgen lattice from 738.19 MB to 44.53 MB while achieving zero topology reconstruction error. Compared with UniMate, it achieves a smaller compressed size with improved geometric fidelity and topology preservation. The combination of learned geometric representation and explicit topology correction provides a practical solution for compressing large lattice graphs.
S2. Comprehensive Compression Pipeline.
The paper integrates geometric representation, topology prediction, learned entropy coding, and residual correction into a unified framework. The inclusion of feature pruning and hash fusion further improves compression efficiency. The ablation studies provide evidence that these components contribute to the reported compression performance.
Critical weaknesses
W1. Limited Generalizability and Evaluation.
The experiments are limited to three procedurally generated lattice datasets with relatively strong spatial regularities. The paper lacks evaluations on real-world industrial lattices or complex structures derived from arbitrary 3D meshes. Since the method heavily relies on spatial locality, its compression performance on more irregular geometries and diverse topologies remains unclear. The current experiments are insufficient to demonstrate its general applicability.
W2. Questionable Practical Utility and Unjustified Complexity.
The practical necessity of the proposed framework is unclear. Since all evaluated lattices are procedurally generated, storing the source geometry and generation parameters may be more efficient than compressing the resulting graphs. Moreover, CLC requires approximately 77 minutes for encoding and 25 minutes for decoding a large lattice, raising concerns about its practical usability. The paper also lacks comparisons with simpler geometry-aware compression methods, making it difficult to justify the substantial computational overhead of the learned architecture.
Questions for authors
Q1. Practical Motivation and Application Scenarios
What are the concrete application scenarios that require storing these large lattice graphs instead of regenerating them from source geometry and procedural parameters? Given the substantial decoding time, how would CLC benefit practical CAD or additive manufacturing workflows?
Q2. Compression vs. Regeneration
Since all evaluated datasets are procedurally generated, could the authors compare CLC against storing the source geometry and generation parameters, considering both storage requirements and reconstruction time?
Q3. Computational Cost vs. Compression Benefits
Given that CLC requires approximately 25 minutes to decode the Tetgen lattice, what practical advantages justify this computational cost compared with conventional compression methods that decode in seconds?
5 comments
[W2] Questionable Practical Utility and Unjustified Complexity.
[A] We thank the reviewer for raising these practical concerns. Procedural generation helps us construct varied lattice instances for evaluation. CAD-based models such as Gear, Hinge, and Connector undergo topology optimization for different loading conditions. Graphics-derived models such as Dragon, Kitten, and Bunny use different generation parameters and include random perturbations to node positions, radii, and connectivity. These modifications produce final lattice graphs that cannot be specified by the source shape and basic generation parameters alone. Different loading conditions and mechanical applications may also require distinct optimized structures. Table 1 in the main paper includes comparisons with the geometry-aware compressors Draco and G-PCC. We recognize that the current CLC implementation incurs substantial runtime and GPU-memory costs, as discussed in Appendix F. Improving the computational and memory efficiency of CLC remains an important direction for future work.
[Q1] Practical Motivation and Application Scenarios.
[A] We thank the reviewer for this question. For lattices adapted to specific loading conditions through topology optimization, assembled from different unit-cell types, or modified by stochastic changes to geometry and connectivity, the final node and edge graph is not determined by the source geometry and basic procedural parameters alone. In additive manufacturing, storing and exchanging the finalized graph can support design archiving and transfer to downstream preparation. The storage burden grows when multiple lattices are assembled into a larger model, making compact representation of the instantiated graph especially relevant. CLC reduces this storage burden while reconstructing geometry with high fidelity and preserving connectivity losslessly. Its current decoding time, however, limits its suitability for interactive CAD operations or time-critical workflows. We therefore see the immediate application as offline storage and exchange of finalized designs, with faster decoding needed for broader integration into design and manufacturing workflows. We have added this discussion to the second paragraph of the Conclusion.
[Q2] Compression vs. Regeneration.
[A] We thank the reviewer for suggesting this comparison. We agree that a source STL and basic parameters for generating a regular lattice can require only a few MB. These inputs, however, do not reproduce the final lattice graphs in our dataset. For example, CAD-based models such as Gear, Hinge, and Connector undergo topology optimization to meet different loading conditions. Graphics-derived models such as Dragon, Kitten, and Bunny are generated with varied parameter combinations and receive random perturbations to node positions, radii, and connectivity. The resulting structures are determined by these instance-specific design choices and modifications, not by the source geometry and basic generation parameters alone.
[Q3] Computational Cost vs. Compression Benefits.
[A] We agree that decoding the large Tetgen lattice takes approximately 25 minutes, whereas conventional codecs decode it in seconds. The relevant use case is offline storage and exchange of finalized lattice graphs, as discussed in Q1, rather than repeated decoding during interactive CAD editing. On Tetgen, Table 1 in the main paper reports a combined geometry-and-topology size of 55.99 MB for CLC at the highrate setting, compared with 187.82 MB for xz and 265.20 MB for zstd. This is a 3.35× and 4.74× reduction in stored size, respectively, with high-fidelity geometry and lossless topology. The storage advantage is useful when archiving or transferring finalized designs, particularly as lattice assemblies grow, but the current decoding time remains a limitation for latency-sensitive workflows.
Thank you for the detailed rebuttal and additional experiments. I acknowledge the new ablation results and clarifications.
However, my main concerns remain:
- Limited generalizability. Despite the additional statistics, the evaluation remains restricted to three procedurally generated lattice families, without convincing evidence of broader applicability.
- Questionable practical utility. The authors clarify the motivation for offline storage, but the substantial computational overhead remains a major limitation. The paper still lacks a quantitative comparison with procedural regeneration or a convincing real-world application demonstrating the benefits of this trade-off.
Overall, I appreciate the additional experiments, but they do not sufficiently address my fundamental concerns about the practical significance and general applicability of the method.
I maintain my original rating of 2 (Weak Reject).
We sincerely thank the reviewer for the thoughtful feedback and insightful questions.
[W1] Limited Generalizability and Evaluation.
[A] We thank the reviewer for raising this concern. Although the lattices are procedurally generated, some models based on mechanical CAD components, such as Gear, Hinge, and Connector, undergo topology optimization for different loading conditions. Graphics-derived models, including Dragon, Kitten, and Bunny, use varied generation parameters and incorporate random perturbations to node positions, radii, and connectivity. The lattices also include targeted local refinements, including near boundaries or voids. We have added two tables and a figure in Appendix D.4: the first summarizes the lattice models, the second reports geometric variability and topological characteristics for nine instances, and the figure shows their node-degree distributions. These measurements document variation across the characterized Tetgen, Voronoi, and Hexahedron instances. For the reviewer's convenience, we reproduce the two tables below.
Table 1. Statistics of the generated lattice models.
Table 2. Geometric variability and topological characteristics of nine lattice models. CV is the coefficient of variation, degree entropy uses base-2 logarithms, and edge-orientation anisotropy is (3λₘₐₓ − 1)/2, where λₘₐₓ is the largest eigenvalue of the mean outer product of nonzero unit-edge directions.