Tsallis entropy for geometry simplification
View/ Open
Impact
Scholar |
Other documents of the author: Castelló Boscá, Pascual; González, Carlos; Sbert Casasayas, Mateu; Feixas, Miguel; Chover, Miguel
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/43662
comunitat-uji-handle3:10234/43643
comunitat-uji-handle4:
INVESTIGACIONMetadata
Title
Tsallis entropy for geometry simplificationAuthor (s)
Date
2011-09-29Publisher
MDPI PublishingISSN
1099-4300Type
info:eu-repo/semantics/articlePublisher version
http://www.mdpi.com/1099-4300/13/10/1805Version
info:eu-repo/semantics/publishedVersionSubject
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–Charva ́t–Tsallis ... [+]
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–Charva ́t–Tsallis entropy and mutual information have been applied. These measures have been used in the error metric of a surface simplification 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). [-]
Is part of
Entropy (2011) vol. 13, no. 10, pp. 1805-1828Rights
info:eu-repo/semantics/openAccess
This item appears in the folowing collection(s)
- INIT_Articles [742]
The following license files are associated with this item: