期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Visual salience guided feature-aware shape simplification
1
作者 Yong-wei MIAO Fei-xia HU +2 位作者 Min-yan CHEN Zhen LIU Hua-hao SHOU 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2014年第9期744-753,共10页
In the area of 3D digital engineering and 3D digital geometry processing, shape simplification is an important task to reduce their requirement of large memory and high time complexity. By incorporating the content-aw... In the area of 3D digital engineering and 3D digital geometry processing, shape simplification is an important task to reduce their requirement of large memory and high time complexity. By incorporating the content-aware visual salience measure of a polygonal mesh into simplification operation, a novel feature-aware shape simplification approach is presented in this paper. Owing to the robust extraction of relief heights on 3D highly detailed meshes, our visual salience measure is defined by a center-surround operator on Gaussian-weighted relief heights in a scale-dependent manner. Guided by our visual salience map, the feature-aware shape simplification algorithm can be performed by weighting the high-dimensional feature space quadric error metric of vertex pair contractions with the weight map derived from our visual salience map. The weighted quadric error metric is calculated in a six-dimensional feature space by combining the position and normal information of mesh vertices. Experimental results demonstrate that our visual salience guided shape simplification scheme can adaptively and effectively re-sample the underlying models in a feature-aware manner, which can account for the visually salient features of the complex shapes and thus yield better visual fidelity. 展开更多
关键词 VISUAL salience Shape SIMPLIFICATION Content-aware WEIGHTED QUADRIC error metric feature-aware
原文传递
A Spectral Segmentation Method for Large Meshes
2
作者 Xiaohan Bao Weihua Tong Falai Chen 《Communications in Mathematics and Statistics》 SCIE CSCD 2023年第3期583-607,共25页
Mesh segmentation is a fundamental and critical task in mesh processing,and it has been studied extensively in computer graphics and geometric modeling communities.However,current methods are not well suited for segme... Mesh segmentation is a fundamental and critical task in mesh processing,and it has been studied extensively in computer graphics and geometric modeling communities.However,current methods are not well suited for segmenting large meshes which are now common in many applications.This paper proposes a new spectral segmentation method specifically designed for large meshes inspired by multi-resolution representations.Building on edge collapse operators and progressive mesh representations,we first devise a feature-aware simplification algorithm that can generate a coarse mesh which keeps the same topology as the input mesh and preserves as many features of the input mesh as possible.Then,using the spectral segmentation method proposed in Tong et al.(IEEE Trans Vis Comput Graph 26(4):1807–1820,2020),we perform partition on the coarse mesh to obtain a coarse segmentation which mimics closely the desired segmentation of the input mesh.By reversing the simplification process through vertex split operators,we present a fast algorithm which maps the coarse segmentation to the input mesh and therefore obtain an initial segmentation of the input mesh.Finally,to smooth some jaggy boundaries between adjacent parts of the initial segmentation or align with the desired boundaries,we propose an efficient method to evolve those boundaries driven by geodesic curvature flows.As demonstrated by experimental results on a variety of large meshes,our method outperforms the state-of-the-art segmentation method in terms of not only speed but also usability. 展开更多
关键词 Mesh segmentation Spectral method Progressive mesh feature-aware simplification Geodesic curvature flow
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部