Parallel mesh clustering

Authors:
Iurie Chiosa;Andreas Kolb;Nicolas Cuntz;Marvin Lindner
Affiliations:
Institute for Vision and Graphics, University of Siegen, Siegen, Germany;Institute for Vision and Graphics, University of Siegen, Siegen, Germany;Institute for Vision and Graphics, University of Siegen, Siegen, Germany;Institute for Vision and Graphics, University of Siegen, Siegen, Germany
Venue:
EG PGV'09 Proceedings of the 9th Eurographics conference on Parallel Graphics and Visualization
Year:
2009

Citing 9
Cited 0

Introduction to Solid Modeling

Introduction to Solid Modeling
Region growing on a hypercube multiprocessor

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Parallel algorithms for hierarchical clustering

Parallel Computing
Hierarchical face clustering on polygonal surfaces

I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Variational shape approximation

ACM SIGGRAPH 2004 Papers
A realtime GPU subdivision kernel

ACM SIGGRAPH 2005 Papers
Hierarchical mesh segmentation based on fitting primitives

The Visual Computer: International Journal of Computer Graphics
Real-time mesh simplification using the GPU

Proceedings of the 2007 symposium on Interactive 3D graphics and games
Quadric surface extraction by variational shape approximation

GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast and qualitative clustering of large polygonal surface meshes still remains one of the most demanding fields in mesh processing. Because existing clustering algorithms are very time-consuming, the use of parallel hardware, i.e. the graphics processing unit (GPU), is a reasonable and crucial task in this domain. However, due to the sequential nature of most of these algorithms this is hard to be achieved. In this paper we address the parallel reformulation of the existing approaches and show a suitable GPU implementation for variational or hierarchical parallel mesh clustering. A boundary-based mesh clustering framework is proposed as a new clustering concept which provides all necessary ingredients for parallel mesh clustering. Here we focus on a specific subtype of the variational clustering algorithm which does not restrict the applicability of the approach as such but reveals much better performance characteristics. A parallel multilevel (ML) mesh clustering, for which several dual edges are collapsed in each step, is proposed as an option to the classical ML clustering, where only one dual edge collapse is applied in each step. We show how these algorithms can be entirely implemented (giving some non-trivial GPU-specific solutions) and accelerated on GPU. We demonstrate both approaches applying them to Centroidal Voronoi Diagram (CVD) based clustering. For boundary-based mesh clustering we achieved speed up factors of 10 to 18.