| dc.contributor.author | Carr, Nathan A. | en_US |
| dc.contributor.author | Hart, John C. | en_US |
| dc.contributor.editor | Roberto Scopigno and Denis Zorin | en_US |
| dc.date.accessioned | 2014-01-29T09:19:55Z | |
| dc.date.available | 2014-01-29T09:19:55Z | |
| dc.date.issued | 2004 | en_US |
| dc.identifier.isbn | 3-905673-13-4 | en_US |
| dc.identifier.issn | 1727-8384 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/SGP/SGP04/229-240 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Geometric algorithms | en_US |
| dc.title | Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces | en_US |
| dc.description.seriesinformation | Symposium on Geometry Processing | en_US |
