Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces

Simple item page
dc.contributor.authorCarr, Nathan A.en_US
dc.contributor.authorHart, John C.en_US
dc.contributor.editorRoberto Scopigno and Denis Zorinen_US
dc.date.accessioned2014-01-29T09:19:55Z
dc.date.available2014-01-29T09:19:55Z
dc.date.issued2004en_US
dc.description.abstractNumerous 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.description.seriesinformationSymposium on Geometry Processingen_US
dc.identifier.isbn3-905673-13-4en_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttps://doi.org/10.2312/SGP/SGP04/229-240en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Geometric algorithmsen_US
dc.titleTwo Algorithms for Fast Reclustering of Dynamic Meshed Surfacesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
229-240.pdf
Size:
1.38 MB
Format:
Adobe Portable Document Format
Download
Collections
SGP04: Eurographics Symposium on Geometry Processing