Generators of H1(, ∂ c) with ∂ c ⊂ ∂ for Triangulated Surfaces : Construction and Classification of Global Loops

Abstract

Given a compact surface embedded in R3 with boundary ∂ , our goal is to construct a set of representatives for a basis of the relative cohomology group H1(, ∂ c), where c is a specified subset of ∂ . To achieve this, we propose a novel graph-based algorithm with two key features: it is applicable to non-orientable surfaces, thereby generalizing the construction of Hiptmair and Ostrowski [SIAM J. Comput., 31 (2002)], and it has a worst-case time complexity that is linear in the number of edges of the mesh K triangulating . Importantly, this algorithm serves as a critical pre-processing step to address the low-frequency breakdown encountered in boundary element discretizations of integral equation formulations.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…