Efficient Construction of 2-Chains with a Prescribed Boundary
DOI10.1137/15M1025955zbMath1385.55001arXiv1409.5487MaRDI QIDQ5347535
Riccardo Ghiloni, Enrico Bertolazzi, 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
linking numberspanning treeshomological Seifert surfaces2-chains with a prescribed boundarycomplete dual graph
Software, source code, etc. for problems pertaining to algebraic topology (55-04) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Homology and cohomology theories in algebraic topology (55N99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On efficient sparse integer matrix Smith normal form computations
- Recursive coboundary formula for cycles in acyclic chain complexes
- Eddy current approximation of Maxwell equations. Theory, algorithms and applications
- Homology computation by reduction of chain complexes
- Geometric construction of a coboundary of a cycle
- The topology of Helmholtz domains
- Construction of a Finite Element Basis of the First de Rham Cohomology Group and Numerical Solution of 3D Magnetostatic Problems
- Optimal homologous cycles, total unimodularity, and linear programming
- 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
- Generators of $H_1(\Gamma_{h},\mathbbZ)$ for Triangulated Surfaces: Construction and Classification
- Minimal Surfaces
- Regularity of Minimal Surfaces
- Global Analysis of Minimal Surfaces
- Numerical Approximation of Parametric Oriented Area-Minimizing Hypersurfaces
- Computing Least Area Hypersurfaces Spanning Arbitrary Boundaries
- Vector Calculus and the Topology of Domains in 3-Space
- Finite Element Methods for Maxwell's Equations
- Electromagnetic Theory and Computation
- An algorithmic approach to the construction of homomorphisms induced by maps in homology
- The least spanning area of a knot and the optimal bounding chain problem
- Locally flat imbeddings of topological manifolds
This page was built for publication: Efficient Construction of 2-Chains with a Prescribed Boundary