Skip to Main Content
Parallel computational structure is helpful for many complicated problems, especially those which can be divided into multiple independent simpler sub-problems. The ordered binary decision diagrams (OBDD)-based splitting surface search algorithm owns this kind of dividability, derived from the associative law of Boolean expression and the dividability of matrix operation. We have implemented the algorithm with the parallel computation structure MPI to save up computing time. Customized verification is available on our interactive illustrative website http://obdd.cfins.au.tsinghua.edu.cn/ (login user name: mag, password: 199707).