SGP04: Eurographics Symposium on Geometry Processing
Permanent URI for this collection
Browse
Browsing SGP04: Eurographics Symposium on Geometry Processing by Subject "Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Geometric algorithms"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces(The Eurographics Association, 2004) Carr, Nathan A.; Hart, John C.; Roberto Scopigno and Denis ZorinNumerous 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.