Definition:The decimation method in CPM (Compressed Progressive Meshes)[1]is “edge collapsing”, which collapses the two ending points of the selected edge to the midpoint.
CPM collects “edge collapsing” into batches to achieve a high compression rate. The connectivity information of the removed vertex is encoded with the identifiers of the two cut-edges. CPM applies Butterfly subdivision scheme to predict the displacement of the new vertex. The error between the predicted and the original positions is stored as the geometric data in each batch. The amortized connectivity encoding takes 7.2 bits, while the geometry encoding takes 15.4 bits per vertex. Figure 1 shows the base mesh M0 and the mesh M1 constructed with CPM. From M1 to M0, two edges A’A’’ and F’F’’ are collapsed to the midpoints A and F, respectively.
CPM vertex split and edge collapse.
This is a preview of subscription content, log in via an institution.
References
R. Pajarola and J. Rossignac, “Compressed progressive meshes”, IEEE Transactions on Visualization and Computer Graphics, Vol. 6, pp. 79–93.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this entry
Cite this entry
(2006). Compressed Progressive Meshes. In: Furht, B. (eds) Encyclopedia of Multimedia. Springer, Boston, MA. https://doi.org/10.1007/0-387-30038-4_28
Download citation
DOI: https://doi.org/10.1007/0-387-30038-4_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-24395-5
Online ISBN: 978-0-387-30038-2
eBook Packages: Computer ScienceReference Module Computer Science and Engineering