Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/2549
Назив: | A combinatorial approach based on forman theory | Аутори: | Čomić, Lidija De Floriani L. Magillo P. Iuricich F. |
Датум издавања: | 1-јан-2014 | Часопис: | SpringerBriefs in Computer Science | Сажетак: | © The Author(s) 2014. In this chapter, we review algorithms based on Forman theory. These algorithms are combinatorial in nature and, thus, dimension-independent. Forman-based algorithms start from a Forman gradient vector field computed as a preliminary step. We discuss how to encode a Forman gradient over irregular simplicial complexes, by taking into account the relation between the input simplicial complex and its dual, and between the descending and ascending Morse complexes (Sect. 5.1). We describe the main algorithms for computing a Forman gradient on 2D and 3D scalar fields (Sect. 5.3). Finally we present algorithms which, given a Forman gradient, extract the collection of cells of the ascending and descending Morse complexes, the Morse-Smale cells, or the vertices and edges of the Morse-Smale complex (Sect. 5.4). | URI: | https://open.uns.ac.rs/handle/123456789/2549 | ISSN: | 21915768 | DOI: | 10.1007/978-1-4939-2149-2_5 |
Налази се у колекцијама: | FTN Publikacije/Publications |
Приказати целокупан запис ставки
Преглед/и станица
11
Протекла недеља
1
1
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.