Two algorithms for fast reclustering of dynamic meshed surfaces

Nathan A. Carr, John C. Hart

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

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.

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

Publication series

NameACM International Conference Proceeding Series
Volume71

Other

Other2nd Symposium on Geometry Processing, SGP 2004
CountryFrance
CityNice
Period7/8/047/10/04

Keywords

  • I.3.3 [Computer Graphics]: Geometric algorithms

ASJC Scopus subject areas

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

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

  • Cite this

    Carr, N. A., & Hart, J. C. (2004). Two algorithms for fast reclustering of dynamic meshed surfaces. In SGP 2004 - Symposium on Geometry Processing (pp. 224-234). (ACM International Conference Proceeding Series; Vol. 71). https://doi.org/10.1145/1057432.1057462