|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM174687532 |
003 |
DE-627 |
005 |
20231223140455.0 |
007 |
tu |
008 |
231223s2007 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed24n0582.xml
|
035 |
|
|
|a (DE-627)NLM174687532
|
035 |
|
|
|a (NLM)17968095
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Gyulassy, Attila
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Efficient computation of Morse-Smale complexes for three-dimensional scalar functions
|
264 |
|
1 |
|c 2007
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
500 |
|
|
|a Date Completed 14.12.2007
|
500 |
|
|
|a Date Revised 30.10.2007
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Natarajan, Vijay
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Pascucci, Valerio
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Hamann, Bernd
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 13(2007), 6 vom: 01. Nov., Seite 1440-7
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
773 |
1 |
8 |
|g volume:13
|g year:2007
|g number:6
|g day:01
|g month:11
|g pages:1440-7
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 13
|j 2007
|e 6
|b 01
|c 11
|h 1440-7
|