Colin Neil Jones, Georgios Stathopoulos
Two characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous ...
SPRINGER/PLENUM PUBLISHERS2019
