By Topic

Balanced hierarchical face clustering algorithm on triangle meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhi Wang ; Inst. of Virtual Reality & Virtual Technol., Beijing Normal Univ., Beijing, China ; Zhongke Wu ; Mingquan Zhou ; Yanlin Luo

In this paper we propose a new algorithm of face clustering on triangle meshes, we call it balanced hierarchical face clustering (BHFC for short). Given a triangle mesh model, the algorithm iteratively generates a binary tree of face clusters on it. Each cluster consists of a set of connected faces. At every iteration, two connected clusters are chosen according to these rules we define, and they are merged into a new cluster. For each iteration there are two steps. In the first step, a set of cluster pair candidates is determined. In the second step, a single pair in the candidate set is chosen to merge. After the iteration, a hierarchical structure of clusters is constructed. The hierarchical structure is balanced, which avoids extreme size clusters appearing in the clustered result.

Published in:

Computer-Aided Design and Computer Graphics, 2009. CAD/Graphics '09. 11th IEEE International Conference on

Date of Conference:

19-21 Aug. 2009