Entropy 2011, 13(10), 1805-1828; doi:10.3390/e13101805

Tsallis Entropy for Geometry Simplification

1,* email, 1, 1, 2 and 2
Received: 1 August 2011; in revised form: 20 September 2011 / Accepted: 27 September 2011 / Published: 29 September 2011
(This article belongs to the Special Issue Tsallis Entropy)
Download PDF [10102 KB, uploaded 29 September 2011]
Abstract: This paper presents a study and a comparison of the use of different information-theoretic measures for polygonal mesh simplification. Generalized measures from Information Theory such as Havrda–Charvát–Tsallis entropy and mutual information have been applied. These measures have been used in the error metric of a surfaces implification algorithm. We demonstrate that these measures are useful for simplifying three-dimensional polygonal meshes. We have also compared these metrics with the error metrics used in a geometry-based method and in an image-driven method. Quantitative results are presented in the comparison using the root-mean-square error (RMSE).
Keywords: information theory; viewpoint information measures; mesh simplification
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |

MDPI and ACS Style

Castelló, P.; González, C.; Chover, M.; Sbert, M.; Feixas, M. Tsallis Entropy for Geometry Simplification. Entropy 2011, 13, 1805-1828.

AMA Style

Castelló P, González C, Chover M, Sbert M, Feixas M. Tsallis Entropy for Geometry Simplification. Entropy. 2011; 13(10):1805-1828.

Chicago/Turabian Style

Castelló, Pascual; González, Carlos; Chover, Miguel; Sbert, Mateu; Feixas, Miquel. 2011. "Tsallis Entropy for Geometry Simplification." Entropy 13, no. 10: 1805-1828.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert