This article is
- freely available
Tsallis Entropy for Geometry Simplification
Departamento de Lenguajes y Sistemas Informáticos, Institute of New Imaging Technologies, Universitat Jaume I, Campus de Riu Sec, Castellón E-12071, Spain
Institut d’Informàtica i Aplicacions, Universitat de Girona, Campus Montilivi, Girona E-17071, Spain
* Author to whom correspondence should be addressed.
Received: 1 August 2011; in revised form: 20 September 2011 / Accepted: 27 September 2011 / Published: 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
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
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.
Castelló P, González C, Chover M, Sbert M, Feixas M. Tsallis Entropy for Geometry Simplification. Entropy. 2011; 13(10):1805-1828.
Castelló, Pascual; González, Carlos; Chover, Miguel; Sbert, Mateu; Feixas, Miquel. 2011. "Tsallis Entropy for Geometry Simplification." Entropy 13, no. 10: 1805-1828.