Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/5595
DC FieldValueLanguage
dc.contributor.authorČomić, Lidijaen
dc.contributor.authorDe Floriani L.en
dc.contributor.authorIuricich F.en
dc.date.accessioned2019-09-30T08:49:02Z-
dc.date.available2019-09-30T08:49:02Z-
dc.date.issued2013-01-01en
dc.identifier.issn16123786en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/5595-
dc.description.abstract© Springer-Verlag Berlin Heidelberg 2013. Morse and Morse-Smale complexes have been recognized as a suitable tool for modeling the topology of a manifold M through a decomposition of M induced by a scalar field f defined over M. We consider here the problem of representing, constructing and simplifying Morse and Morse-Smale complexes in 3D. We first describe and compare two data structures for encoding 3D Morse and Morse-Smale complexes. We describe, analyze and compare algorithms for computing such complexes. Finally, we consider the simplification of Morse and Morse-Smale complexes by applying coarsening operators on them, and we discuss and compare the coarsening operators on Morse and Morse-Smale complexes described in the literature.en
dc.relation.ispartofMathematics and Visualizationen
dc.titleModeling three-dimensional morse and morse-smale complexesen
dc.typeBook Chapteren
dc.identifier.doi10.1007/978-3-642-34141-0_1en
dc.identifier.scopus2-s2.0-84961211214en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84961211214en
dc.relation.lastpage34en
dc.relation.firstpage3en
dc.relation.issue202529en
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptFakultet tehničkih nauka, Departman za opšte discipline u tehnici-
crisitem.author.parentorgFakultet tehničkih nauka-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

2
checked on May 10, 2024

Page view(s)

10
Last Week
0
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.