Abstract | ||
---|---|---|
The relation between two Morse functions defined on a smooth, compact, and orientable 2-manifold can be studied in terms of their Jacobi set. The Jacobi set contains points in the domain where the gradients of the two functions are aligned. Both the Jacobi set itself as well as the segmentation of the domain it induces, have shown to be useful in various applications. In practice, unfortunately, functions often contain noise and discretization artifacts, causing their Jacobi set to become unmanageably large and complex. Although there exist techniques to simplify Jacobi sets, they are unsuitable for most applications as they lack fine-grained control over the process, and heavily restrict the type of simplifications possible.This paper introduces the theoretical foundations of a new simplification framework for Jacobi sets. We present a new interpretation of Jacobi set simplification based on the perspective of domain segmentation. Generalizing the cancellation of critical points from scalar functions to Jacobi sets, we focus on simplifications that can be realized by smooth approximations of the corresponding functions, and show how these cancellations imply simultaneous simplification of contiguous subsets of the Jacobi set. Using these extended cancellations as atomic operations, we introduce an algorithm to successively cancel subsets of the Jacobi set with minimal modifications to some user-defined metric. We show that for simply connected domains, our algorithm reduces a given Jacobi set to its minimal configuration, that is, one with no birth-death points (a birth-death point is a specific type of singularity within the Jacobi set where the level sets of the two functions and the Jacobi set have a common normal direction). |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.comgeo.2014.10.009 | Comput. Geom. |
Keywords | DocType | Volume |
smoothness,simplification | Journal | 48 |
Issue | ISSN | Citations |
4 | 0925-7721 | 5 |
PageRank | References | Authors |
0.50 | 21 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Harsh Bhatia | 1 | 85 | 8.99 |
Bei Wang | 2 | 528 | 61.48 |
Gregory Norgard | 3 | 22 | 2.43 |
Valerio Pascucci | 4 | 3241 | 192.33 |
Peer-Timo Bremer | 5 | 1446 | 82.47 |