An Efficient Algorithm for Cutting Multiply Connected Regions

摘要

This paper presents a method for checking the connectivity of a set of finite elements and for dividing the set into simply connected sub-sets. The algorithm is based on expansion from a simply connected sub-set. The algorithm could be used to determine cut surfaces, but it is shown that simply connected sub-sets are more suitable in practice.