Jianhui Ye | Huazhong University of Science and Technology (original) (raw)
Uploads
Papers by Jianhui Ye
Rev. Colomb. de Computación, 2003
To simplify the 3D color head mesh ,it is more important to keep the boundary and quality of the ... more To simplify the 3D color head mesh ,it is more important to keep the boundary and quality of the heads sense organs including eyes, eyebrows, nose and mouth. In this paper, we present a novel mesh simplification algorithm based on region segmentation. The algorithm can be divided into two stages: segmentation and simplification. After the automatic segmentation of 3D color head mesh into different head parts, vertices are classed into region-boundary vertices and region-inner vertices. Using iterative edge collapse and region-weighted error metric, the algorithm generates continuous levels of detail (LOD). Results of several experiments are shown, demonstrating the validity and efficiency of our method.
Machine Graphics & Vision International Journal archive, Dec 1, 2002
Complex triangle meshes arise extensively in computer graphics. Such meshes greatly exceed the pr... more Complex triangle meshes arise extensively in computer graphics. Such meshes greatly exceed the processing power of modern computer hardware and need to be simplified. The purpose of this paper is to simplify a 3D color human head mesh acquired from a 3D laser scanner. It is more important to keep the boundaries and quality of the sense organs which are the region of interest, while it is reasonable to simplify other features of the head aggressively, such as hair, face and neck. Based on these heuristics, we present a novel vertex merging mesh simplification algorithm based on region segmentation. The algorithm can be divided into two stages: segmentation and simplification. First, the 3D color head mesh is segmented into different head parts with respect to both geometry and attributes, then vertices are classified into region-inner vertices and region-boundary vertices. Second, iterative vertex merging is applied using region-weighted error metric in order to implement controllable simplifications. Results of several experiments are shown, demonstrating the potential of our method for a 3D color head mesh. Also, our method is resistant to noise in practical applications.
Rev. Colomb. de Computación, 2003
To simplify the 3D color head mesh ,it is more important to keep the boundary and quality of the ... more To simplify the 3D color head mesh ,it is more important to keep the boundary and quality of the heads sense organs including eyes, eyebrows, nose and mouth. In this paper, we present a novel mesh simplification algorithm based on region segmentation. The algorithm can be divided into two stages: segmentation and simplification. After the automatic segmentation of 3D color head mesh into different head parts, vertices are classed into region-boundary vertices and region-inner vertices. Using iterative edge collapse and region-weighted error metric, the algorithm generates continuous levels of detail (LOD). Results of several experiments are shown, demonstrating the validity and efficiency of our method.
Machine Graphics & Vision International Journal archive, Dec 1, 2002
Complex triangle meshes arise extensively in computer graphics. Such meshes greatly exceed the pr... more Complex triangle meshes arise extensively in computer graphics. Such meshes greatly exceed the processing power of modern computer hardware and need to be simplified. The purpose of this paper is to simplify a 3D color human head mesh acquired from a 3D laser scanner. It is more important to keep the boundaries and quality of the sense organs which are the region of interest, while it is reasonable to simplify other features of the head aggressively, such as hair, face and neck. Based on these heuristics, we present a novel vertex merging mesh simplification algorithm based on region segmentation. The algorithm can be divided into two stages: segmentation and simplification. First, the 3D color head mesh is segmented into different head parts with respect to both geometry and attributes, then vertices are classified into region-inner vertices and region-boundary vertices. Second, iterative vertex merging is applied using region-weighted error metric in order to implement controllable simplifications. Results of several experiments are shown, demonstrating the potential of our method for a 3D color head mesh. Also, our method is resistant to noise in practical applications.