Skip to Main content Skip to Navigation
Book sections

Optimal General Simplification of Scalar Fields on Surfaces

Abstract : We present a new combinatorial algorithm for the optimal general topological simplification of scalar fields on surfaces. Given a piecewise linear (PL) scalar field f , our algorithm generates a simplified PL field g that provably admits critical points only from a constrained subset of the singularities of f while minimizing the 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 and additionally minimizes the distance || f − g||∞ in the PL setting. Experiments show the generality of the algorithm as well as its time-efficiency, and demonstrate in practice the minimization of || f − g||∞ .
Document type :
Book sections
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Julien Tierny Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2015 - 11:38:21 AM
Last modification on : Sunday, June 26, 2022 - 10:00:30 AM
Long-term archiving on: : Saturday, January 2, 2016 - 10:15:01 AM


Files produced by the author(s)


  • HAL Id : hal-01206848, version 1


Julien Tierny, David Guenther, Valerio Pascucci. Optimal General Simplification of Scalar Fields on Surfaces. Topological and Statistical Methods for Complex Data, 2015, 978-3-662-44900-4. ⟨hal-01206848⟩



Record views


Files downloads