Results 1  10
of
22
Topology Preserving Edge Contraction
 Publ. Inst. Math. (Beograd) (N.S
, 1998
"... We study edge contractions in simplicial complexes and local conditions under which they preserve the topological type. The conditions are based on a generalized notion of boundary, which lends itself to defining a nested hierarchy of triangulable spaces measuring the distance to being a manifold. ..."
Abstract

Cited by 60 (6 self)
 Add to MetaCart
We study edge contractions in simplicial complexes and local conditions under which they preserve the topological type. The conditions are based on a generalized notion of boundary, which lends itself to defining a nested hierarchy of triangulable spaces measuring the distance to being a manifold.
Querying Spatial Databases via Topological Invariants
 In PODS'98
, 1998
"... The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of topological queries against the spatial database into queries against the topological invariant. The languages considered ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of topological queries against the spatial database into queries against the topological invariant. The languages considered are firstorder on the spatial database side, and fixpoint + counting, fixpoint, and firstorder on the topological invariant side. In particular, it is shown that fixpoint + counting expresses precisely all the ptime queries on topological invariants; if the regions are connected, fixpoint expresses all ptime queries on topological invariants. 1 Introduction Spatial data is an increasingly important part of database systems. It is present in a wide range of applications: geographic information systems, video databases, medical imaging, CADCAM, VLSI, robotics, etc. Different applications pose different requirements on query languages and therefore on the kind of spatial information th...
Homological Illusions of Persistence and Stability
, 2008
"... In this thesis we explore and extend the theory of persistent homology, which captures topological features of a function by pairing its critical values. The result is represented by a collection of points in the extended plane called persistence diagram. We start with the question of ridding the fu ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
In this thesis we explore and extend the theory of persistent homology, which captures topological features of a function by pairing its critical values. The result is represented by a collection of points in the extended plane called persistence diagram. We start with the question of ridding the function of topological noise as suggested by its persistence diagram. We give an algorithm for hierarchically finding such εsimplifications on 2manifolds as well as answer the question of when it is impossible to simplify a function in higher dimensions. We continue by examining timevarying functions. The original algorithm computes the persistence pairing from an ordering of the simplices in a triangulation and takes worstcase time cubic in the number of simplices. We describe how to maintain the pairing in linear time per transposition of consecutive simplices. A side effect of the update algorithm is an elementary proof of the stability of persistence diagrams. We introduce a parametrized family of persistence diagrams called persistence vineyards and illustrate the concept with a vineyard describing a folding of a small peptide. We also base a simple algorithm to compute the rank invariant of a collection of functions on the update procedure.
Algorithms for recognizing knots and 3manifolds
 Chaos, Solitons and Fractals
, 1998
"... Algorithms are of interest to geometric topologists for two reasons. First, they have bearing on the decidability of a problem. Certain topological questions, such as finding a classification of four dimensional manifolds, admit no solution. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Algorithms are of interest to geometric topologists for two reasons. First, they have bearing on the decidability of a problem. Certain topological questions, such as finding a classification of four dimensional manifolds, admit no solution.
Topological characteristics of random surfaces generated by cubic interactions
"... Abstract: We consider random topologies of surfaces generated by cubic interactions. Such surfaces arise in various contexts in 2dimensional quantum gravity and as worldsheets of string theory. Our results are most conveniently expressed in terms of a parameter h = n/2+χ, where n is the number of i ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract: We consider random topologies of surfaces generated by cubic interactions. Such surfaces arise in various contexts in 2dimensional quantum gravity and as worldsheets of string theory. Our results are most conveniently expressed in terms of a parameter h = n/2+χ, where n is the number of interaction vertices and χ is the Euler characteristic of the surface. Simulations and results for similar models suggest that Ex[h] = log(3n) + γ +O(1/n) and Var[h] = log(3n)+γ −π2 /6+O(1/n). We prove rigourously that Ex[h] = log n + O(1) and Var[h] = O(log n). We also derive results concerning a number of other characteristics of the topology of these random surfaces.
Constructing Discrete Morse Functions
, 2002
"... Morse theory has been considered a powerful tool in its applications to computational topology, computer graphics and geometric modeling. It was originally formulated for smooth manifolds. Recently, Robin Forman formulated a version of this theory for discrete structures such as cell complexes. It o ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Morse theory has been considered a powerful tool in its applications to computational topology, computer graphics and geometric modeling. It was originally formulated for smooth manifolds. Recently, Robin Forman formulated a version of this theory for discrete structures such as cell complexes. It opens up several categories of interesting objects (particularly meshes) to applications of Morse theory. Once a