@inproceedings{4b6ad9aae40640fabdb9a49550bde418,
title = "Two algorithms for fast reclustering of dynamic meshed surfaces",
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.",
keywords = "I.3.3 [Computer Graphics]: Geometric algorithms",
author = "Carr, {Nathan A.} and Hart, {John C.}",
year = "2004",
doi = "10.1145/1057432.1057462",
language = "English (US)",
isbn = "3905673134",
series = "ACM International Conference Proceeding Series",
pages = "224--234",
booktitle = "SGP 2004 - Symposium on Geometry Processing",
note = "2nd Symposium on Geometry Processing, SGP 2004 ; Conference date: 08-07-2004 Through 10-07-2004",
}