The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2012 vol.18)
pp: 2005-2013
J. Tierny , Telecom ParisTech, Paris, France
V. Pascucci , Pacific Northwest Nat. Lab. & ViSUS Inc., Univ. of Utah, Salt Lake City, UT, USA
ABSTRACT
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.
INDEX TERMS
Topology, Algorithm design and analysis, Robustness, Noise measurement, Level set, Geometry, topological simplification, Scalar field visualization, scalar field design
CITATION
J. Tierny, V. Pascucci, "Generalized Topological Simplification of Scalar Fields on Surfaces", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 12, pp. 2005-2013, Dec. 2012, doi:10.1109/TVCG.2012.228
REFERENCES
[1] P. Agarwal, L. Arge, and K. Yi, I/O-efficient batched union-find and its applications to terrain analysis. In ACM Symp. on Comp. Geom., pages 167-176, 2006.
[2] D. Attali, M. Glisse, S. Hornus, F. Lazarus, and D. Morozov, Persistence-sensitive simplification of functions on surfaces in linear time. In TopoInVis Workshop, 2009.
[3] U. Bauer, C. Lange, and M. Wardetzky, Optimal topological simplification of discrete functions on surfaces. Discrete and Computational Geometry, pages 347-377, 2012.
[4] P.-T. Bremer, H. Edelsbrunner, B. Hamann, and V. Pascucci, A topological hierarchy for functions on triangulated surfaces. IEEE Trans. on Vis. and Comp. Graph., 10: 385-396, 2004.
[5] H. Carr, J. Snoeyink, and A. Ulrike, Computing contour trees in all dimensions. In Proc. of Symposium on Discrete Algorithms, pages 918-926, 2000.
[6] H. Carr, J. Snoeyink, and M. van de Panne, Simplifying flexible iso-surfaces using local geometric measures. In Proc. of IEEE VIS, pages 497-504, 2004.
[7] K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, Loops in Reeb graphs of 2-manifolds. In ACM Symp. on Comp. Geom., pages 344-350, 2003.
[8] C. Correa, P. Lindstrom, and P. Bremer, Topological splines: A structure-preserving visual representation of scalar fields. IEEE Trans. on Vis. and Comp. Graph. (Proc. of IEEE VIS), 17: 1842-1851, 2011.
[9] H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplification. Discrete & Computational Geometry, 28: 511-533, 2002.
[10] H. Edelsbrunner, D. Morozov, and V. Pascucci, Persistence-sensitive simplification of functions on 2-manifolds. In ACM Symp. on Comp. Geom., pages 127-134, 2006.
[11] R. Forman, A user's guide to discrete Morse theory. Advances in Mathematics, 134: 90-145, 1998.
[12] Y. Gingold and D. Zorin, Controlled-topology filtering. Computer-Aided Design, pages 676-684, 2006.
[13] A. Gyulassy, P.-T. Bremer, B. Hamann, and P. Pascucci, A practical approach to Morse-Smale complex computation: scalabity and generality. IEEE Trans. on Vis. and Comp. Graph. (Proc. of IEEE VIS), pages 1619-1626, 2008.
[14] J. Milnor, Morse Theory. Princeton University Press, 1963.
[15] X. Ni, M. Garland, and J. Hart, Fair Morse functions for extracting the topological structure of a surface mesh. ACM Trans. on Graph. (Proc. of ACM SIGGRAPH), 23: 613-622, 2004.
[16] V. Pascucci, G. Scorzelli, P. T. Bremer, and A. Mascarenhas, Robust online computation of Reeb graphs: simplicity and speed. ACM Trans. on Graph. (Proc. of ACM SIGGRAPH), 26: 58.1-58.9 2007.
[17] G. Patanè and B. Falcidieno, Computing smooth approximations of scalar functions with constraints. Computers and Graphics, 33: 399-413, 2009.
[18] U. Pinkall and K. Polthier, Computing discrete minimal surfaces and their conjugates. Exp. Math., pages 15-36, 1993.
[19] P. Soille, Optimal removal of spurious pits in digital elevation models. Water Resources Research, 40, 2004.
[20] J. Tierny, A. Gyulassy, E. Simon, and V. Pascucci, Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees. IEEE Trans. on Vis. and Comp. Graph. (Proc. of IEEE VIS), 15: 1177-1184, 2009.
[21] M. Wardetzky, S. Mathur, F. Kalberer, and E. Grinspun, Discrete Laplace operators: no freen lunch. In Proc. of SGP, pages 33-37, 2007.
[22] T. Weinkauf, Y. Gingold, and O. Sorkine, Topology-based smoothing of 2D scalar fields with C1-continuity. Comp. Graph. Forum (Proc. of EuroVis), 29: 1221-1230, 2010.
[23] K. Xu, H. Zhang, D. Cohen-Or, and Y. Xiong, Dynamic harmonic fields for surface processing. Comput. Graph. (Proc. of SMI), 33: 391-398, 2009.
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool