Results 1  10
of
46
Finding the homology of submanifolds with high confidence from random samples
, 2004
"... Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space. We show how to “learn ” the hom ..."
Abstract

Cited by 117 (7 self)
 Add to MetaCart
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space. We show how to “learn ” the homology of the submanifold with high confidence. We discuss an algorithm to do this and provide learningtheoretic complexity bounds. Our bounds are obtained in terms of a condition number that limits the curvature and nearness to selfintersection of the submanifold. We are also able to treat the situation where the data is “noisy ” and lies near rather than on the submanifold in question.
Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface
, 2001
"... A closed orientable surface of genus g can be obtained by appropriate identication of pairs of edges of a 4ggon (the polygonal schema). The identied edges form 2g loops on the surface, that are disjoint except for their common endpoint. These loops are generators of both the fundamental group and t ..."
Abstract

Cited by 62 (6 self)
 Add to MetaCart
A closed orientable surface of genus g can be obtained by appropriate identication of pairs of edges of a 4ggon (the polygonal schema). The identied edges form 2g loops on the surface, that are disjoint except for their common endpoint. These loops are generators of both the fundamental group and the homology group of the surface. The inverse problem is concerned with nding a set of 2g loops on a triangulated surface, such that cutting the surface along these loops yields a (canonical) polygonal schema. We present two optimal algorithms for this inverse problem. Both algorithms have been implemented using the CGAL polyhedron data structure.
Computational Topology: Ambient Isotopic Approximation of 2Manifolds
 Theoretical Computer Science
, 2001
"... A fundamental issue in theoretical computer science is that of establishing unambiguous formal criteria for algorithmic output. This paper does so within the domain of computeraided geometric modeling. For practical geometric modeling algorithms, it is often desirable to create piecewise linear appr ..."
Abstract

Cited by 28 (14 self)
 Add to MetaCart
A fundamental issue in theoretical computer science is that of establishing unambiguous formal criteria for algorithmic output. This paper does so within the domain of computeraided geometric modeling. For practical geometric modeling algorithms, it is often desirable to create piecewise linear approximations to compact manifolds embedded in and it is usually desirable for these two representations to be "topologically equivalent". Though this has traditionally been taken to mean that the two representations are homeomorphic, such a notion of equivalence suffers from a variety of technical and philosophical difficulties; we adopt the stronger notion of ambient isotopy. It is shown here, that for any , compact, 2manifold without boundary, which is embedded in , there exists a piecewise linear ambient isotopic approximation. Furthermore, this isotopy has compact support, with specific bounds upon the size of this compact neighborhood. These bounds may be useful for practical application in computer graphics and engineering design simulations. The proof given relies upon properties of the medial axis, which is explained in this paper. Email address: amenta@cs.utexas.edu. This author acknowledges, with appreciation, funding from the National Science Foundation under grant number CCR9731977, and a research fellowship from the Alfred P. Sloan Foundation. The views expressed herein are those of the author, not of these sponsors.
Shape understanding by contour driven retiling
 THE VISUAL COMPUTER
, 2003
"... Given a triangle mesh representing a closed manifold surface of arbitrary genus, a method is proposed to automatically extract the Reeb graph of the manifold with respect to the height function. The method is based on a slicing strategy that traces contours while inserting them directly in the mesh ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
Given a triangle mesh representing a closed manifold surface of arbitrary genus, a method is proposed to automatically extract the Reeb graph of the manifold with respect to the height function. The method is based on a slicing strategy that traces contours while inserting them directly in the mesh as constraints. Critical areas, which identify isolated and nonisolated critical points of the surface, are recognized and coded in the extended Reeb graph (ERG). The remeshing strategy guarantees that topological features are correctly maintained in the graph, and the tiling of ERG nodes reproduces the original shape at a minimal, but topologically correct, geometric level.
Optimal discrete Morse functions for 2manifolds
 Computational Geometry: Theory and Applications
, 2003
"... Morse theory is 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 c ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Morse theory is 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 Morse function has been defined on a manifold, then information about its topology can be deduced from its critical elements. The main objective of this paper is to introduce a linear algorithm to define optimal discrete Morse functions on discrete 2manifolds, where optimality entails having the least number of critical elements. The algorithm presented is also extended to general finite cell complexes of dimension at most 2, with no guarantee of optimality.
Computing Homology Groups of Simplicial Complexes in R³
, 1998
"... Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial complexes in R 3 . This paper develops basic techniques required to manipulate and analyze structures ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial complexes in R 3 . This paper develops basic techniques required to manipulate and analyze structures of complexes in R 3 . A new approach to analyze simplicial complexes in Euclidean 3space R 3 is described. First, methods from topology are used to analyze triangulated 3manifolds in R 3 . Then it is shown that these methods can, in fact, be applied to arbitrary simplicial complexes in R 3 after (simulating) the process of thickening a complex to a 3manifold homotopic to it. As a consequence considerable structural information about the complex can be determined and certain discrete problems solved as well. For example, it is shown how to determine the homology groups, as well as concrete representations of their generators, for a given complex in R 3 . Keywords. Topology, homot...
Computational Topology for Shape Modeling
, 1999
"... This paper expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in particular, recurrent models and implicit surfaces, can (often unpredictably) become connected or disconnected based on typi ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
This paper expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in particular, recurrent models and implicit surfaces, can (often unpredictably) become connected or disconnected based on typical changes in modeling parameters. Two methodologies for controlling connectedness are identified: connectedness loci and Morse theory. The survey concludes by identifying several open problems remaining in shape modeling for computational topology to solve. 1 Introduction One might ask "what is topology?" and receive the proper definition: "the study of open sets." While this answer may enlighten some, the novice puzzles "what is an open set?" at about the same time the definition continues on to add that open sets are whatever a topology defines them to be (so long as they pass a few conditions regarding closure under union and intersection, etc.). This might be the main reason students ...