An algorithm, for use on a digital computer, is explained for cutting multiply connected regions in three‐dimensional space. The algorithm is suitable for complex electromagnetic field problems where a magnetic scalar potential, affected by current loops, is to be calculated in a multiply connected region. Problems in fluid dynamics with vorticity affecting a scalar potential, could also be attacked with this algorithm. Since finite element methods are ubiquitous in field calculations, the cuts of the space constructed by the algorithm should ideally correspond to the given discretization; this can be arranged by an application of the Lebesgue Covering Theorem, for which a second algorithm is provided.
No takes yet. Share an insight, caveat, or question.
Malcolm Brown (1984) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: