Two algorithms for fast reclustering of dynamic meshed surfaces

Nathan A. Carr, John C. Hart

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationSGP 2004 - Symposium on Geometry Processing
Number of pages11
StatePublished - 2004
Event2nd Symposium on Geometry Processing, SGP 2004 - Nice, France
Duration: Jul 8 2004Jul 10 2004

Publication series

NameACM International Conference Proceeding Series


Other2nd Symposium on Geometry Processing, SGP 2004


  • I.3.3 [Computer Graphics]: Geometric algorithms

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications


Dive into the research topics of 'Two algorithms for fast reclustering of dynamic meshed surfaces'. Together they form a unique fingerprint.

Cite this