Efficient construction of 2-chains representing a basis of H₂( , ; Z)
2-chains with prescribed boundaryhomological Seifert surfaceslinking numberperturbation of simple loops and 1-cyclesrelative homology
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Homology and cohomology theories in algebraic topology (55N99) Simplicial sets and complexes in algebraic topology (55U10) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Let $\Omega$ be a connected open subset of ${\mathbb R}^3$ whose closure $\overline\Omega$ is a polyhedron with locally flat boundary $\partial\Omega$, and let ${\mathcal T}$ be a triangulation of $\overline\Omega$. The authors present an algorithm for constructing a collection of 1--cycles from ${\mathcal T}$ that lie within $\partial\Omega$ and whose classes in the first integral homology group $H_1(\overline\Omega)$ are trivial, and whose classes in $H_1({\mathbb R}^3\setminus\Omega)$ form a basis. This result extends the algorithm of \textit{R. Hiptmair} and \textit{J. Ostrowski} [SIAM J. Comput. 31, No. 5, 1405--1423 (2002; Zbl 1001.05046)] to include the case when $\partial\Omega$ is not connected. Moreover, this result can be combined with the authors' previous work on constructing homological Seifert surfaces [\textit{A. A. Rodríguez} et al., SIAM J. Numer. Anal. 55, No. 3, 1159--1187 (2017; Zbl 1385.55001)] to yield an algorithm for computing generators for the relative homology group $H_2(\overline\Omega,\partial\Omega)$ with respect to ${\mathcal T}$. The results of numerical experiments are presented that indicate the efficacy of the algorithm.
- Efficient Construction of 2-Chains with a Prescribed Boundary
- Minimal 1-cycles generating a canonical basis of 2-manifold's homology group
- scientific article; zbMATH DE number 2186251
- Annotating simplices with a homology basis and its applications
- Structure on the top homology and related algorithms
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- Computing homology groups of simplicial complexes in R 3
- Construction of a finite element basis of the first de Rham cohomology group and numerical solution of 3D magnetostatic problems
- Coreduction homology algorithm
- Efficient Construction of 2-Chains with a Prescribed Boundary
- Electromagnetic Theory and Computation
- Generators of $H_1(\Gamma_{h},\mathbbZ)$ for Triangulated Surfaces: Construction and Classification
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- Homology and cohomology computation in finite element modeling
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3736614 (Why is no real title available?)
- scientific article; zbMATH DE number 3530652 (Why is no real title available?)
- Locally flat imbeddings of topological manifolds
- On efficient sparse integer matrix Smith normal form computations
- Self-adjoint curl operators
- The topology of Helmholtz domains
- Vector Calculus and the Topology of Domains in 3-Space
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
This page was built for publication: Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633005)
