Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces

Proc. Symposium on Geometry Processing, July 2004

Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two novel approaches for maintaining mesh clusterings on dynamically deforming meshes. The first approach maintains a complete face cluster tree hierarchy using a randomized data structure. The second algorithm maintains a mesh decomposition for a fixed set of clusters. With both algorithms we are able to maintain clusterings on dynamically deforming surfaces of over 100K faces in fractions of a second.

AttachmentSize
recluster.pdf1.39 MB

Theme by Danetsoft and Danang Probo Sayekti inspired by Maksimer