Fast mesh segmentation by approximated spherical patches

Authors:
Zhenyu Shu;Guozhao Wang
Affiliations:
Institute of Computer Graphics and Image Processing, Department of Mathematics, Zhejiang University, Hangzhou, China and Laboratory of Information and Optimization Technologies, Ningbo Institute o ...;Institute of Computer Graphics and Image Processing, Department of Mathematics, Zhejiang University, Hangzhou, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 12
Cited 0

A discourse on geometric feature recognition from CAD models

Journal of Computing and Information Science in Engineering
A survey of methods for recovering quadrics in triangle meshes

ACM Computing Surveys (CSUR)
Least squares conformal maps for automatic texture atlas generation

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Superfaces: Polygonal Mesh Simplification with Bounded Error

IEEE Computer Graphics and Applications
Hierarchical mesh decomposition using fuzzy clustering and cuts

ACM SIGGRAPH 2003 Papers
Making papercraft toys from meshes using strip-based approximate unfolding

ACM SIGGRAPH 2004 Papers
Feature-based surface parameterization and texture mapping

ACM Transactions on Graphics (TOG)
Hierarchical mesh segmentation based on fitting primitives

The Visual Computer: International Journal of Computer Graphics
Paper craft models from meshes

The Visual Computer: International Journal of Computer Graphics
Hierarchical part-type segmentation using voxel-based curve skeletons

The Visual Computer: International Journal of Computer Graphics
A new CAD mesh segmentation method, based on curvature tensor analysis

Computer-Aided Design
From geometric to semantic human body models

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a fast method for segmentation of triangular mesh surfaces into simple patches, where each patch is an approximation of a part of spherical surface. Given a mesh surface, all triangles of it cluster to a user-specified number of patches by energy minimization. All patches of result meshes are as spherical as possible with our algonthm. Experimental results show that our algorithm is efficient and robust.