|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM252628497 |
| 003 |
DE-627 |
| 005 |
20231224164519.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2012 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2012.228
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0842.xml
|
| 035 |
|
|
|a (DE-627)NLM252628497
|
| 035 |
|
|
|a (NLM)26357106
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Tierny, J
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Generalized Topological Simplification of Scalar Fields on Surfaces
|
| 264 |
|
1 |
|c 2012
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 01.12.2015
|
| 500 |
|
|
|a Date Revised 11.09.2015
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a We present a combinatorial algorithm for the general topological simplification of scalar fields on surfaces. Given a scalar field f, our algorithm generates a simplified field g that provably admits only critical points from a constrained subset of the singularities of f, while guaranteeing a small distance ||f - g||∞ for data-fitting purpose. In contrast to previous algorithms, our approach is oblivious to the strategy used for selecting features of interest and allows critical points to be removed arbitrarily. When topological persistence is used to select the features of interest, our algorithm produces a standard ϵ-simplification. Our approach is based on a new iterative algorithm for the constrained reconstruction of sub- and sur-level sets. Extensive experiments show that the number of iterations required for our algorithm to converge is rarely greater than 2 and never greater than 5, yielding O(n log(n)) practical time performances. The algorithm handles triangulated surfaces with or without boundary and is robust to the presence of multi-saddles in the input. It is simple to implement, fast in practice and more general than previous techniques. Practically, our approach allows a user to arbitrarily simplify the topology of an input function and robustly generate the corresponding simplified function. An appealing application area of our algorithm is in scalar field design since it enables, without any threshold parameter, the robust pruning of topological noise as selected by the user. This is needed for example to get rid of inaccuracies introduced by numerical solvers, thereby providing topological guarantees needed for certified geometry processing. Experiments show this ability to eliminate numerical noise as well as validate the time efficiency and accuracy of our algorithm. We provide a lightweight C++ implementation as supplemental material that can be used for topological cleaning on surface meshes
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Pascucci, V
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 18(2012), 12 vom: 10. Dez., Seite 2005-13
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:18
|g year:2012
|g number:12
|g day:10
|g month:12
|g pages:2005-13
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2012.228
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 18
|j 2012
|e 12
|b 10
|c 12
|h 2005-13
|