Efficient Construction of 2-Chains with a Prescribed Boundary

DOI10.1137/15M1025955MaRDI QIDQ5347535zbMATH OpenFDO

Authors Enrico Bertolazzi, Riccardo Ghiloni, Ruben Specogna, Ana M. Alonso Rodriguez

Publication date 24 May 2017

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.5487

zbMATH Keywords

2-chains with a prescribed boundarycomplete dual graphhomological Seifert surfaceslinking numberspanning trees

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Software, source code, etc. for problems pertaining to algebraic topology (55-04) Homology and cohomology theories in algebraic topology (55N99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Let $Omega$ be a bounded domain of $mathbb{R}^3$ whose closure $overlineOmega$ is polyhedral, and let $mathcalT$ be a triangulation of $overlineOmega$. Assuming that the boundary of $Omega$ is sufficiently regular, we provide an explicit formula for the computation of homological Seifert surfaces of any $1$-boundary $gamma$ of $mathcalT$; namely, $2$-chains of $mathcalT$ whose boundary is $gamma$. It is based on the existence of special spanning trees of the complete dual graph of $mathcalT$, and on the computation of certain linking numbers associated with those spanning trees. If the triangulation $mathcalT$ is fine, the explicit formula is too expensive to be used directly. For this reason, making also use of a simple elimination procedure, we devise a fast algorithm for the computation of homological Seifert surfaces. Some numerical experiments illustrate the efficiency of this algorithm.

Recommendations

• Efficient algorithms for approximating polygonal chains
• Improvement on 2-chains inside thin subsets of Euclidean spaces
• Efficient code constructions for certain two-dimensional constraints
• scientific article; zbMATH DE number 4082817
• Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
• Construction of sequences of borderenergetic graphs
• Constructing Belts in Two-Dimensional Arrangements with Applications
• scientific article; zbMATH DE number 1153451
• Incremental construction of 2-structures

Cites work

• An algorithmic approach to the construction of homomorphisms induced by maps in homology
• Computing Least Area Hypersurfaces Spanning Arbitrary Boundaries
• Construction of a finite element basis of the first de Rham cohomology group and numerical solution of 3D magnetostatic problems
• Eddy current approximation of Maxwell equations. Theory, algorithms and applications
• Electromagnetic Theory and Computation
• Generators of $H_1(\Gamma_{h},\mathbbZ)$ for Triangulated Surfaces: Construction and Classification
• Geometric construction of a coboundary of a cycle
• Global analysis of minimal surfaces
• Homology computation by reduction of chain complexes
• scientific article; zbMATH DE number 5304935 (Why is no real title available?)
• 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?)
• scientific article; zbMATH DE number 1266750 (Why is no real title available?)
• Introduction to algorithms.
• Locally flat imbeddings of topological manifolds
• Minimal surfaces. With assistance and contributions by A. Küster and R. Jakob
• Numerical Approximation of Parametric Oriented Area-Minimizing Hypersurfaces
• On efficient sparse integer matrix Smith normal form computations
• Recursive coboundary formula for cycles in acyclic chain complexes
• Regularity of minimal surfaces. With assistance and contributions by A. Küster
• The least spanning area of a knot and the optimal bounding chain problem
• 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

Cited in

(3)

• Efficient construction of 2-chains representing a basis of \(H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})\)
• Improvement on 2-chains inside thin subsets of Euclidean spaces
• Generators of $H_1(\Gamma_{h},\mathbbZ)$ for Triangulated Surfaces: Construction and Classification

This page was built for publication: Efficient Construction of 2-Chains with a Prescribed Boundary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347535)