TY - JOUR AB - We introduce a modification of the classic notion of intrinsic volume using persistence moments of height functions. Evaluating the modified first intrinsic volume on digital approximations of a compact body with smoothly embedded boundary in Rn, we prove convergence to the first intrinsic volume of the body as the resolution of the approximation improves. We have weaker results for the other modified intrinsic volumes, proving they converge to the corresponding intrinsic volumes of the n-dimensional unit ball. AU - Edelsbrunner, Herbert AU - Pausinger, Florian ID - 1662 JF - Advances in Mathematics TI - Approximation and convergence of the intrinsic volume VL - 287 ER - TY - CONF AB - We consider the problem of statistical computations with persistence diagrams, a summary representation of topological features in data. These diagrams encode persistent homology, a widely used invariant in topological data analysis. While several avenues towards a statistical treatment of the diagrams have been explored recently, we follow an alternative route that is motivated by the success of methods based on the embedding of probability measures into reproducing kernel Hilbert spaces. In fact, a positive definite kernel on persistence diagrams has recently been proposed, connecting persistent homology to popular kernel-based learning techniques such as support vector machines. However, important properties of that kernel enabling a principled use in the context of probability measure embeddings remain to be explored. Our contribution is to close this gap by proving universality of a variant of the original kernel, and to demonstrate its effective use in twosample hypothesis testing on synthetic as well as real-world data. AU - Kwitt, Roland AU - Huber, Stefan AU - Niethammer, Marc AU - Lin, Weili AU - Bauer, Ulrich ID - 1424 TI - Statistical topological data analysis-A kernel perspective VL - 28 ER - TY - CONF AB - Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data. We show that this kernel is positive definite and prove its stability with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets for 3D shape classification/retrieval and texture recognition show considerable performance gains of the proposed method compared to an alternative approach that is based on the recently introduced persistence landscapes. AU - Reininghaus, Jan AU - Huber, Stefan AU - Bauer, Ulrich AU - Kwitt, Roland ID - 1483 TI - A stable multi-scale kernel for topological machine learning ER - TY - CONF AB - Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the regular hexagonal grid gives the maximum among lattice configurations. AU - Edelsbrunner, Herbert AU - Iglesias Ham, Mabel AU - Kurlin, Vitaliy ID - 1495 T2 - Proceedings of the 27th Canadian Conference on Computational Geometry TI - Relaxed disk packing VL - 2015-August ER - TY - CONF AB - The concept of well group in a special but important case captures homological properties of the zero set of a continuous map f from K to R^n on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within L_infty distance r from f for a given r > 0. The main drawback of the approach is that the computability of well groups was shown only when dim K = n or n = 1. Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of R^n by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and dim K < 2n-2, our approximation of the (dim K-n)th well group is exact. For the second part, we find examples of maps f, f' from K to R^n with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status. AU - Franek, Peter AU - Krcál, Marek ID - 1510 TI - On computability and triviality of well groups VL - 34 ER - TY - CHAP AB - The Heat Kernel Signature (HKS) is a scalar quantity which is derived from the heat kernel of a given shape. Due to its robustness, isometry invariance, and multiscale nature, it has been successfully applied in many geometric applications. From a more general point of view, the HKS can be considered as a descriptor of the metric of a Riemannian manifold. Given a symmetric positive definite tensor field we may interpret it as the metric of some Riemannian manifold and thereby apply the HKS to visualize and analyze the given tensor data. In this paper, we propose a generalization of this approach that enables the treatment of indefinite tensor fields, like the stress tensor, by interpreting them as a generator of a positive definite tensor field. To investigate the usefulness of this approach we consider the stress tensor from the two-point-load model example and from a mechanical work piece. AU - Zobel, Valentin AU - Reininghaus, Jan AU - Hotz, Ingrid ED - Hotz, Ingrid ED - Schultz, Thomas ID - 1531 SN - 978-3-319-15089-5 T2 - Visualization and Processing of Higher Order Descriptors for Multi-Valued Data TI - Visualizing symmetric indefinite 2D tensor fields using The Heat Kernel Signature VL - 40 ER - TY - JOUR AB - We show that incorporating spatial dispersal of individuals into a simple vaccination epidemic model may give rise to a model that exhibits rich dynamical behavior. Using an SIVS (susceptible-infected-vaccinated-susceptible) model as a basis, we describe the spread of an infectious disease in a population split into two regions. In each subpopulation, both forward and backward bifurcations can occur. This implies that for disconnected regions the two-patch system may admit several steady states. We consider traveling between the regions and investigate the impact of spatial dispersal of individuals on the model dynamics. We establish conditions for the existence of multiple nontrivial steady states in the system, and we study the structure of the equilibria. The mathematical analysis reveals an unusually rich dynamical behavior, not normally found in the simple epidemic models. In addition to the disease-free equilibrium, eight endemic equilibria emerge from backward transcritical and saddle-node bifurcation points, forming an interesting bifurcation diagram. Stability of steady states, their bifurcations, and the global dynamics are investigated with analytical tools, numerical simulations, and rigorous set-oriented numerical computations. AU - Knipl, Diána AU - Pilarczyk, Pawel AU - Röst, Gergely ID - 1555 IS - 2 JF - SIAM Journal on Applied Dynamical Systems TI - Rich bifurcation structure in a two patch vaccination model VL - 14 ER - TY - CONF AB - Aiming at the automatic diagnosis of tumors from narrow band imaging (NBI) magnifying endoscopy (ME) images of the stomach, we combine methods from image processing, computational topology, and machine learning to classify patterns into normal, tubular, vessel. Training the algorithm on a small number of images of each type, we achieve a high rate of correct classifications. The analysis of the learning algorithm reveals that a handful of geometric and topological features are responsible for the overwhelming majority of decisions. AU - Dunaeva, Olga AU - Edelsbrunner, Herbert AU - Lukyanov, Anton AU - Machin, Michael AU - Malkova, Daria ID - 1568 T2 - Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing TI - The classification of endoscopy images with persistent homology ER - TY - CONF AB - My personal journey to the fascinating world of geometric forms started more than 30 years ago with the invention of alpha shapes in the plane. It took about 10 years before we generalized the concept to higher dimensions, we produced working software with a graphics interface for the three-dimensional case. At the same time, we added homology to the computations. Needless to say that this foreshadowed the inception of persistent homology, because it suggested the study of filtrations to capture the scale of a shape or data set. Importantly, this method has fast algorithms. The arguably most useful result on persistent homology is the stability of its diagrams under perturbations. AU - Edelsbrunner, Herbert ID - 1567 T2 - 23rd International Symposium TI - Shape, homology, persistence, and stability VL - 9411 ER - TY - JOUR AB - For a given self-map $f$ of $M$, a closed smooth connected and simply-connected manifold of dimension $m\geq 4$, we provide an algorithm for estimating the values of the topological invariant $D^m_r[f]$, which equals the minimal number of $r$-periodic points in the smooth homotopy class of $f$. Our results are based on the combinatorial scheme for computing $D^m_r[f]$ introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013), 63-84]. An open-source implementation of the algorithm programmed in C++ is publicly available at {\tt http://www.pawelpilarczyk.com/combtop/}. AU - Graff, Grzegorz AU - Pilarczyk, Pawel ID - 1563 IS - 1 JF - Topological Methods in Nonlinear Analysis TI - An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds VL - 45 ER - TY - JOUR AB - We prove that the dual of the digital Voronoi diagram constructed by flooding the plane from the data points gives a geometrically and topologically correct dual triangulation. This provides the proof of correctness for recently developed GPU algorithms that outperform traditional CPU algorithms for constructing two-dimensional Delaunay triangulations. AU - Cao, Thanhtung AU - Edelsbrunner, Herbert AU - Tan, Tiowseng ID - 1578 IS - 7 JF - Computational Geometry TI - Triangulations from topologically correct digital Voronoi diagrams VL - 48 ER - TY - JOUR AB - We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights. AU - Biedl, Therese AU - Held, Martin AU - Huber, Stefan AU - Kaaser, Dominik AU - Palfrader, Peter ID - 1584 IS - 5 JF - Computational Geometry: Theory and Applications TI - Reprint of: Weighted straight skeletons in the plane VL - 48 ER - TY - JOUR AB - We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights. AU - Biedl, Therese AU - Held, Martin AU - Huber, Stefan AU - Kaaser, Dominik AU - Palfrader, Peter ID - 1582 IS - 2 JF - Computational Geometry: Theory and Applications TI - Weighted straight skeletons in the plane VL - 48 ER - TY - JOUR AB - We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlogn) time and O(n) space, where n denotes the number of vertices of the polygon. AU - Biedl, Therese AU - Held, Martin AU - Huber, Stefan AU - Kaaser, Dominik AU - Palfrader, Peter ID - 1583 IS - 2 JF - Information Processing Letters TI - A simple algorithm for computing positively weighted straight skeletons of monotone polygons VL - 115 ER - TY - CHAP AB - The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed. AU - Aichholzer, Oswin AU - Biedl, Therese AU - Hackl, Thomas AU - Held, Martin AU - Huber, Stefan AU - Palfrader, Peter AU - Vogtenhuber, Birgit ID - 1590 SN - 978-3-319-27260-3 T2 - Graph Drawing and Network Visualization TI - Representing directed trees as straight skeletons VL - 9411 ER - TY - JOUR AB - We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α > 0, it holds that each function g: K → ℝn such that ||g - f || ∞ < α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K > 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings. AU - Franek, Peter AU - Krcál, Marek ID - 1682 IS - 4 JF - Journal of the ACM TI - Robust satisfiability of systems of equations VL - 62 ER - TY - JOUR AB - We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by a function u : (-1, 1) → ℝ, u(x) < 0, and a vertical flow of point particles incident on the hollow. It is assumed that u satisfies the so-called single impact condition (SIC): each incident particle is elastically reflected by graph(u) and goes away without hitting the graph of u anymore. We solve the problem: find the function u minimizing the force of resistance created by the flow. We show that the graph of the minimizer is formed by two arcs of parabolas symmetric to each other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals 1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014), pp. 2730-2742] stating in particular that the minimal resistance of a hollow in higher dimensions equals 0.5. We additionally consider a similar problem of minimal resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1 is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x = (x1,...,xd), u(ξ) < 0 for 0 ≤ ξ < 1, and u(ξ) = 0 for ξ ≥ 1, and the flow is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides with 0.6435 when d = 1) and converges to 0.5 as d → ∞. AU - Akopyan, Arseniy AU - Plakhov, Alexander ID - 1710 IS - 4 JF - Society for Industrial and Applied Mathematics TI - Minimal resistance of curves under the single impact assumption VL - 47 ER - TY - JOUR AB - We construct a non-linear Markov process connected with a biological model of a bacterial genome recombination. The description of invariant measures of this process gives us the solution of one problem in elementary probability theory. AU - Akopyan, Arseniy AU - Pirogov, Sergey AU - Rybko, Aleksandr ID - 1828 IS - 1 JF - Journal of Statistical Physics TI - Invariant measures of genetic recombination process VL - 160 ER - TY - JOUR AB - We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2. AU - Pausinger, Florian AU - Steinerberger, Stefan ID - 1938 IS - 6 JF - Physics Letters, Section A TI - On the distribution of local extrema in quantum chaos VL - 379 ER - TY - JOUR AB - Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility. AU - Edelsbrunner, Herbert AU - Jablonski, Grzegorz AU - Mrozek, Marian ID - 2035 IS - 5 JF - Foundations of Computational Mathematics TI - The persistent homology of a self-map VL - 15 ER - TY - JOUR AB - We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard. AU - Attali, Dominique AU - Bauer, Ulrich AU - Devillers, Olivier AU - Glisse, Marc AU - Lieutier, André ID - 1805 IS - 8 JF - Computational Geometry: Theory and Applications TI - Homological reconstruction and simplification in R3 VL - 48 ER - TY - JOUR AB - We present a software platform for reconstructing and analyzing the growth of a plant root system from a time-series of 3D voxelized shapes. It aligns the shapes with each other, constructs a geometric graph representation together with the function that records the time of growth, and organizes the branches into a hierarchy that reflects the order of creation. The software includes the automatic computation of structural and dynamic traits for each root in the system enabling the quantification of growth on fine-scale. These are important advances in plant phenotyping with applications to the study of genetic and environmental influences on growth. AU - Symonova, Olga AU - Topp, Christopher AU - Edelsbrunner, Herbert ID - 1793 IS - 6 JF - PLoS One TI - DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots VL - 10 ER - TY - GEN AU - Symonova, Olga AU - Topp, Christopher AU - Edelsbrunner, Herbert ID - 9737 TI - Root traits computed by DynamicRoots for the maize root shown in fig 2 ER - TY - JOUR AB - Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop a new concept of variation of multivariate functions on a compact Hausdorff space with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka theorem that holds for this notion of variation and discrepancy with respect to D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions, such as extreme or isotropic discrepancy. For extreme discrepancy, our result coincides with the usual Koksma-Hlawka theorem. We show that the space of functions of bounded D-variation contains important discontinuous functions and is closed under natural algebraic operations. Finally, we illustrate the results on concrete integration problems from integral geometry and stereology. AU - Pausinger, Florian AU - Svane, Anne ID - 1792 IS - 6 JF - Journal of Complexity TI - A Koksma-Hlawka inequality for general discrepancy systems VL - 31 ER - TY - THES AB - This thesis is concerned with the computation and approximation of intrinsic volumes. Given a smooth body M and a certain digital approximation of it, we develop algorithms to approximate various intrinsic volumes of M using only measurements taken from its digital approximations. The crucial idea behind our novel algorithms is to link the recent theory of persistent homology to the theory of intrinsic volumes via the Crofton formula from integral geometry and, in particular, via Euler characteristic computations. Our main contributions are a multigrid convergent digital algorithm to compute the first intrinsic volume of a solid body in R^n as well as an appropriate integration pipeline to approximate integral-geometric integrals defined over the Grassmannian manifold. AU - Pausinger, Florian ID - 1399 SN - 2663-337X TI - On the approximation of intrinsic volumes ER - TY - CHAP AB - Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data. AU - Kasten, Jens AU - Reininghaus, Jan AU - Reich, Wieland AU - Scheuermann, Gerik ED - Bremer, Peer-Timo ED - Hotz, Ingrid ED - Pascucci, Valerio ED - Peikert, Ronald ID - 10893 SN - 1612-3786 T2 - Topological Methods in Data Analysis and Visualization III TI - Toward the extraction of saddle periodic orbits VL - 1 ER - TY - JOUR AB - Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques. AU - Huber, Stefan AU - Held, Martin AU - Meerwald, Peter AU - Kwitt, Roland ID - 1816 IS - 1 JF - International Journal of Computational Geometry and Applications TI - Topology-preserving watermarking of vector graphics VL - 24 ER - TY - JOUR AB - We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices. AU - Cibulka, Josef AU - Gao, Pu AU - Krcál, Marek AU - Valla, Tomáš AU - Valtr, Pavel ID - 1842 IS - 1 JF - Discrete & Computational Geometry TI - On the geometric ramsey number of outerplanar graphs VL - 53 ER - TY - JOUR AB - We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets. AU - Dolbilin, Nikolai AU - Edelsbrunner, Herbert AU - Glazyrin, Alexey AU - Musin, Oleg ID - 1876 IS - 3 JF - Moscow Mathematical Journal SN - 16093321 TI - Functionals on triangulations of delaunay sets VL - 14 ER - TY - JOUR AB - We propose an algorithm for the generalization of cartographic objects that can be used to represent maps on different scales. AU - Alexeev, V V AU - Bogaevskaya, V G AU - Preobrazhenskaya, M M AU - Ukhalov, A Y AU - Edelsbrunner, Herbert AU - Yakimova, Olga ID - 1929 IS - 6 JF - Journal of Mathematical Sciences SN - 1072-3374 TI - An algorithm for cartographic generalization that preserves global topology VL - 203 ER - TY - JOUR AB - (Figure Presented) Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications. AU - Günther, David AU - Jacobson, Alec AU - Reininghaus, Jan AU - Seidel, Hans AU - Sorkine Hornung, Olga AU - Weinkauf, Tino ID - 1930 IS - 12 JF - IEEE Transactions on Visualization and Computer Graphics TI - Fast and memory-efficient topological denoising of 2D and 3D scalar fields VL - 20 ER - TY - CONF AB - Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically – as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems [1], we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits the computation of much larger instances than on a single machine. Moreover, we observe that the parallelism at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms. In our experiments, we were able to compute the persistent homology of filtrations with more than a billion (109) elements within seconds on a cluster with 32 nodes using less than 6GB of memory per node. AU - Bauer, Ulrich AU - Kerber, Michael AU - Reininghaus, Jan ED - McGeoch, Catherine ED - Meyer, Ulrich ID - 2043 T2 - Proceedings of the Workshop on Algorithm Engineering and Experiments TI - Distributed computation of persistent homology ER - TY - CHAP AB - We present a parallel algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which uses discrete Morse Theory to compute persistence; we derive the same worst-case complexity bound in a more general context. The algorithm employs several practical optimization techniques, which are of independent interest. Our sequential implementation of the algorithm is competitive with state-of-the-art methods, and we further improve the performance through parallel computation. AU - Bauer, Ulrich AU - Kerber, Michael AU - Reininghaus, Jan ED - Bremer, Peer-Timo ED - Hotz, Ingrid ED - Pascucci, Valerio ED - Peikert, Ronald ID - 2044 T2 - Topological Methods in Data Analysis and Visualization III TI - Clear and Compress: Computing Persistent Homology in Chunks ER - TY - CONF AB - We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s). AU - Bauer, Ulrich AU - Lesnick, Michael ID - 2153 T2 - Proceedings of the Annual Symposium on Computational Geometry TI - Induced matchings of barcodes and the algebraic stability of persistence ER - TY - CONF AB - We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s). AU - Bauer, Ulrich AU - Ge, Xiaoyin AU - Wang, Yusu ID - 2156 T2 - Proceedings of the Annual Symposium on Computational Geometry TI - Measuring distance between Reeb graphs ER - TY - CONF AB - Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s). AU - Bauer, Ulrich AU - Edelsbrunner, Herbert ID - 2155 T2 - Proceedings of the Annual Symposium on Computational Geometry TI - The morse theory of Čech and Delaunay filtrations ER - TY - CONF AB - We give evidence for the difficulty of computing Betti numbers of simplicial complexes over a finite field. We do this by reducing the rank computation for sparse matrices with to non-zero entries to computing Betti numbers of simplicial complexes consisting of at most a constant times to simplices. Together with the known reduction in the other direction, this implies that the two problems have the same computational complexity. AU - Edelsbrunner, Herbert AU - Parsa, Salman ID - 2177 T2 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms TI - On the computational complexity of betti numbers reductions from matrix rank ER - TY - JOUR AB - Given topological spaces X,Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X→ Y. We consider a computational version, where X,Y are given as finite simplicial complexes, and the goal is to compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected; in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [X,Y] is known to be uncomputable for general X,Y, since for X = S1 it includes a well known undecidable problem: testing triviality of the fundamental group of Y. In follow-up papers, the algorithm is shown to run in polynomial time for d fixed, and extended to other problems, such as the extension problem, where we are given a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or computing the Z2-index-everything in the stable range. Outside the stable range, the extension problem is undecidable. AU - Čadek, Martin AU - Krcál, Marek AU - Matoušek, Jiří AU - Sergeraert, Francis AU - Vokřínek, Lukáš AU - Wagner, Uli ID - 2184 IS - 3 JF - Journal of the ACM TI - Computing all maps into a sphere VL - 61 ER - TY - CONF AB - Persistent homology is a recent grandchild of homology that has found use in science and engineering as well as in mathematics. This paper surveys the method as well as the applications, neglecting completeness in favor of highlighting ideas and directions. AU - Edelsbrunner, Herbert AU - Morozovy, Dmitriy ID - 2905 TI - Persistent homology: Theory and practice ER - TY - CONF AB - In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings. AU - Biedl, Therese AU - Huber, Stefan AU - Palfrader, Peter ID - 10892 SN - 0302-9743 T2 - 25th International Symposium, ISAAC 2014 TI - Planar matchings for weighted straight skeletons VL - 8889 ER - TY - BOOK AB - This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students of these fields. AU - Edelsbrunner, Herbert ID - 6853 SN - 2191-530X TI - A Short Course in Computational Geometry and Topology ER - TY - CONF AB - We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set. AU - Zobel, Valentin AU - Reininghaus, Jan AU - Hotz, Ingrid ID - 10886 SN - 1612-3786 T2 - Topological Methods in Data Analysis and Visualization III TI - Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature ER - TY - CHAP AB - The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption. AU - Günther, David AU - Reininghaus, Jan AU - Seidel, Hans-Peter AU - Weinkauf, Tino ED - Bremer, Peer-Timo ED - Hotz, Ingrid ED - Pascucci, Valerio ED - Peikert, Ronald ID - 10817 SN - 1612-3786 T2 - Topological Methods in Data Analysis and Visualization III. TI - Notes on the simplification of the Morse-Smale complex ER - TY - JOUR AB - Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm. AU - Edelsbrunner, Herbert AU - Pausinger, Florian ID - 2255 IS - 1 JF - Journal of Mathematical Imaging and Vision SN - 09249907 TI - Stable length estimates of tube-like shapes VL - 50 ER - TY - CONF AB - PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations. AU - Bauer, Ulrich AU - Kerber, Michael AU - Reininghaus, Jan AU - Wagner, Hubert ID - 10894 SN - 0302-9743 T2 - ICMS 2014: International Congress on Mathematical Software TI - PHAT – Persistent Homology Algorithms Toolbox VL - 8592 ER - TY - GEN AB - The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of overlap with other balls. We study two natural choices of overlap measures and obtain the optimal lattice packings in a parameterized family of lattices which contains the FCC, BCC, and integer lattice. AU - Iglesias Ham, Mabel AU - Kerber, Michael AU - Uhler, Caroline ID - 2012 T2 - arXiv TI - Sphere packing with limited overlap ER - TY - CONF AB - A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985. AU - Biedl, Therese AU - Held, Martin AU - Huber, Stefan ID - 2209 TI - Recognizing straight skeletons and Voronoi diagrams and reconstructing their input ER - TY - CONF AB - A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model. AU - Biedl, Therese AU - Held, Martin AU - Huber, Stefan ID - 2210 T2 - 29th European Workshop on Computational Geometry TI - Reconstructing polygons from embedded straight skeletons ER - TY - JOUR AB - This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter. AU - Pausinger, Florian ID - 2304 JF - Electronic Notes in Discrete Mathematics TI - Van der Corput sequences and linear permutations VL - 43 ER - TY - CONF AB - We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov's result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \no holes up to dimension k-1" (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex. AU - Čadek, Martin AU - Krcál, Marek AU - Matoušek, Jiří AU - Vokřínek, Lukáš AU - Wagner, Uli ID - 2807 T2 - 45th Annual ACM Symposium on theory of computing TI - Extending continuous maps: Polynomiality and undecidability ER -