2011
DOI: 10.1016/j.amc.2011.03.040
|View full text |Cite
|
Sign up to set email alerts
|

Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…The diagonal value in Σ is defined in (8), λ i is the eigenvalue of A. Σ ii =√λ i (8) The diagonal value Σ ii decreases in descending order, then truncate the small eigenvalues of Σ and store the result in Σ + , as shown in (9).…”
Section: 22mentioning
confidence: 99%
See 1 more Smart Citation
“…The diagonal value in Σ is defined in (8), λ i is the eigenvalue of A. Σ ii =√λ i (8) The diagonal value Σ ii decreases in descending order, then truncate the small eigenvalues of Σ and store the result in Σ + , as shown in (9).…”
Section: 22mentioning
confidence: 99%
“…Later, the compression of the mesh model evolved. For the current research, the simplified algorithm still deserves further study in the relatively large 3D model, no matter in the compression effect or in the compression time [9].…”
Section: Introductionmentioning
confidence: 99%