Recover from non-flippable configurations in parallel approaches to three dimensional kinetic regular triangulations
Tilo Beyer, Michael Meyer‐Hermann · 2006
The Lawson flip algorithm for three dimensional regular triangulations can lead to non-flippable configurations. Up to now incremental changes to the triangulation are the only way to solve this problem. This enforces a serial algorithm which can not be generalized to a parallel algorithm. A practical solution to this problem suitable for a parallel implementation of the Lawson flip algorithm is presented. Instead of avoiding the generation of non-flippable configurations a method to correct a non-regular triangulation is introduced which reconstructs regular triangulations when the flip algorithm has failed. This enables an efficient parallel simulation of three dimensional particle dynamics based on regular triangulations.