Curve skeleton extraction by coupled graph contraction and surface clustering

  • Authors:

  • Wei Jiang;Kai Xu;Zhi-Quan Cheng;Ralph R. Martin;Gang Dang

  • Affiliations:

  • School of Computer, National University of Defense Technology, Changsha City, Hunan Province 410073, China;School of Computer, National University of Defense Technology, Changsha City, Hunan Province 410073, China;School of Computer, National University of Defense Technology, Changsha City, Hunan Province 410073, China;School of Computer Science and Informatics, Cardiff University, Cardiff, Wales CF24 3AA, UK;School of Computer, National University of Defense Technology, Changsha City, Hunan Province 410073, China

  • Venue:
  • Graphical Models
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a practical algorithm to extract a curve skeleton of a 3D shape. The core of our algorithm comprises coupled processes of graph contraction and surface clustering. Given a 3D shape represented by a triangular mesh, we first construct an initial skeleton graph by directly copying the connectivity and geometry information from the input mesh. Graph contraction and surface clustering are then performed iteratively. The former merges certain graph nodes based on computation of an approximate centroidal Voronoi diagram, seeded by subsampling the graph nodes from the previous iteration. Meanwhile, a coupled surface clustering process serves to regularize the graph contraction. Constraints are used to ensure that extremities of the graph are not shortened undesirably, to ensure that skeleton has the correct topological structure, and that surface clustering leads to an approximately-centered skeleton of the input shape. These properties lead to a stable and reliable skeleton graph construction algorithm. Experiments demonstrate that our skeleton extraction algorithm satisfies various desirable criteria. Firstly, it produces a skeleton homotopic with the input (the genus of both shapes agree) which is both robust (results are stable with respect to noise and remeshing of the input shape) and reliable (every boundary point is visible from at least one curve-skeleton location). It can also handle point cloud data if we first build an initial skeleton graph based on k-nearest neighbors. In addition, a secondary output of our algorithm is a skeleton-to-surface mapping, which can e.g. be used directly for skinning animation. Highlights: (1) An algorithm for curve skeleton extraction from 3D shapes based on coupled graph contraction and surface clustering. (2) The algorithm meets various desirable criteria and can be extended to work for incomplete point clouds.