English
Related papers

Related papers: Simplicial approximation to CW complexes with sphe…

200 papers

This paper provides a self-contained exploration of subdivisions of simplicial complexes, with emphasis on barycentric subdivision. We present formal definitions of subdivisions, show how the realization of a complex is preserved under…

General Topology · Mathematics 2025-11-24 Sanjay Mishra

We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…

Computational Geometry · Computer Science 2015-05-07 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Algebraic Topology · Mathematics 2020-03-24 Sylvain Douteau

We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…

Computational Geometry · Computer Science 2007-05-23 Vin de Silva

We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…

Algebraic Topology · Mathematics 2026-01-06 Ruizhi Huang

We show a Whitney Approximation Theorem for a continuous map from a manifold to a smooth CW complex. This enables us to show that a topological CW complex is homotopy equivalent to a smooth CW complex in a category of topological spaces. It…

Algebraic Topology · Mathematics 2022-08-12 Norio Iwase

This paper proposes a new method which builds a simplex based approximation of a $d-1$-dimensional manifold $M$ separating a $d$-dimensional compact set into two parts, and an efficient algorithm classifying points according to this…

Computational Geometry · Computer Science 2018-07-18 Guillaume Deffuant

In this paper, we study the shape reconstruction problem, when the shape we wish to reconstruct is an orientable smooth d-dimensional submanifold of the Euclidean space. Assuming we have as input a simplicial complex K that approximates the…

Computational Geometry · Computer Science 2025-03-20 Dominique Attali , André Lieutier

We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic…

Computational Geometry · Computer Science 2013-03-27 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

Commutative Algebra · Mathematics 2013-03-15 Rashid Zaare-Nahandi

Interpolating unstructured data using barycentric coordinates becomes infeasible at high dimensions due to the prohibitive memory requirements of building a Delaunay triangulation. We present a new algorithm to construct ad-hoc simplices…

Instrumentation and Methods for Astrophysics · Physics 2022-08-10 Stefan Lüders , Klaus Dolag

Derived differential manifolds are constructed using the usual homotopy theory of simplicial rings of smooth functions. They are proved to be equivalent to derived differential manifolds of finite type, constructed using homotopy sheaves of…

Differential Geometry · Mathematics 2011-12-02 Dennis Borisov , Justin Noel

We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H…

Computational Geometry · Computer Science 2018-03-22 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh , Mathijs Wintraecken

In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…

Commutative Algebra · Mathematics 2025-01-20 Sara Faridi , Thiago Holleben

Recent increase in the availability of warped images projected onto a manifold (e.g., omnidirectional spherical images), coupled with the success of higher-order assignment methods, has sparked an interest in the search for improved…

Computer Vision and Pattern Recognition · Computer Science 2020-07-30 Charu Sharma , Manohar Kaul

It is a well-known fact that, under mild sampling conditions, the restricted Delaunay triangulation provides good topological approximations of 1- and 2-manifolds. We show that this is not the case for higher-dimensional manifolds, even…

Computational Geometry · Computer Science 2008-12-18 Steve Y. Oudot

The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult…

Computational Geometry · Computer Science 2017-03-21 Jean-Daniel Boissonnat , Mael Rouxel-Labbé , Mathijs Wintraecken

We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…

Machine Learning · Computer Science 2020-06-23 Stefania Ebli , Gard Spreemann

The restricted Delaunay triangulation of a closed surface $\Sigma$ and a finite point set $V \subset \Sigma$ is a subcomplex of the Delaunay tetrahedralization of $V$ whose triangles approximate $\Sigma$. It is well known that if $V$ is a…

Computational Geometry · Computer Science 2026-03-23 Jonathan Richard Shewchuk

This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…

Differential Geometry · Mathematics 2012-05-22 Daniel J. Pons
‹ Prev 1 2 3 10 Next ›