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.展开更多
In this paper a new mesh simplification algorithm based on triangle collapses is presented. The algorithm can provide efficient error management and simplify the original mesh greatly. Progressive meshes may be constr...In this paper a new mesh simplification algorithm based on triangle collapses is presented. The algorithm can provide efficient error management and simplify the original mesh greatly. Progressive meshes may be constructed with triangle collapsing operation. To make continuous transition between level of detail (LOD) models possible, a method for interpolating is also presented. Examples illustrate the efficiency of the algorithm.展开更多
基金supported by the National Natural Science Foundation of China(Nos.61877056,61972368)the Anhui Provincial Natural Science Foundation,PR China(No.1908085QA11).
文摘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.
基金This research work is supported by the Fellowship of Hong Kong Polytechnic University and the NationalNatural Science Foundati
文摘In this paper a new mesh simplification algorithm based on triangle collapses is presented. The algorithm can provide efficient error management and simplify the original mesh greatly. Progressive meshes may be constructed with triangle collapsing operation. To make continuous transition between level of detail (LOD) models possible, a method for interpolating is also presented. Examples illustrate the efficiency of the algorithm.
