Introduction to algorithms
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Multilevel algorithms for multi-constraint graph partitioning
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Clustered principal components for precomputed radiance transfer
ACM SIGGRAPH 2003 Papers
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
ACM SIGGRAPH 2004 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Progressive multiresolution meshes for deforming surfaces
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
Ray tracing dynamic scenes using selective restructuring
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
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.