Fast and effective striping

An algorithm for striping triangle meshes in the context of OpenSG is presented. The technique is similar to STRIPE, however, a careful yet simple implementation leads to significant faster execution. Furthermore, we propose to randomly sample several partitions and chose the one that minimizes a given cost function. More samples are expected to lead to better solutions, thus, introducing a parameter to scale between speed and quality.