Time filter

Source Type

Zhu W.-P.,Sun Yat Sen University | Zhu W.-P.,Shanghai Institute of Technology | Gao C.-Y.,Sun Yat Sen University | Gao C.-Y.,Guangdong Engineering Laboratory of Digital Home Interactive Applications | And 2 more authors.
Ruan Jian Xue Bao/Journal of Software | Year: 2012

This paper proposes an anisotropic quad-dominant remeshing algorithm suitable for meshes of arbitrary topology. It takes an approach to the challenging problem of obtaining an anisotropic quad-dominant mesh. The method consists of operations that sample surface geometry by dense principle curvature lines and sort curvature-lines by variations of surface normal and volume related to them. The anisotropic sampling of curvature lines is then obtained by implementing a prioritization scheme of curvature lines elimination. The strategy is simple and straightforward to implement. It is flexible to produce anisotropic quad-dominant meshes ranging from dense to coarse too. The resulting meshes exhibit better anisotropic distribution than comparable methods while maintaining high geometric fidelity. © 2012 ISCAS.


Lu L.,Sun Yat Sen University | Lu L.,Guangdong Engineering Laboratory of Digital Home Interactive Applications | Lu L.,Zhongshan Iker Digital Technology Co. | Xia S.,Delaware State University | And 4 more authors.
Journal of Information and Computational Science | Year: 2012

In computer graphics and geometric modeling, shapes are often represented by triangular meshes (also called 3D meshes or manifold triangulations). These original meshes are usually notoriously expensive to store, transmit and operating (such as mesh compression, remeshing, morphing, multi-resolution analysis, etc). The parameterization of triangular mesh plays an important role in overcoming these problems. A parameterization of a triangular mesh can be viewed as a one-to-one mapping from the mesh to a suitable domain. The parameterization of triangular mesh is also important in surface approximation, texture mapping, animation, etc. In this paper we propose a fast and efficient method for triangular mesh operation, including parameterization and segmentation. The computational complexity of our algorithm is linear. In addition, the parameterization obtained in this paper can be regarded as a well estimated initial value of any other methods if one want to use iterative algorithms to solve the system of linear equations obtained from triangular mesh parameterization. © 2012 Binary Information Press.


Yu C.,Delaware State University | Lu L.,Sun Yat Sen University | Lu L.,Guangdong Engineering Laboratory of Digital Home Interactive Applications | Liu F.,Delaware State University | And 3 more authors.
Journal of Information and Computational Science | Year: 2012

In this paper we present a non-symmetric G 1 method to blend the corner of three coordinate planes with piecewise quadratic algebraic surfaces. We obtain the necessary and sufficient condition of algebraic G 1 blending surface. Unfortunately, the blending surfaces may contain holes or may be not well defined if they only satisfy the algebraic G 1 conditions. To overcome this problem, we introduce the so-called geometric G 1 conditions of the blending surfaces. We also obtain the necessary and sufficient condition of geometric G 1 blending surface. At the same time, we prove that there doesn't exist any geometric G 1 piecewise quadratic algebraic surface that can blend concave corners. Through the parameters in the space partitions, we can easily adjust the blending domain to control the shape of blending surfaces. To our knowledge, for corner blending, it is the first time that the geometric G 1 problem is addressed. © 2012 Binary Information Press.

Loading Guangdong Engineering Laboratory of Digital Home Interactive Applications collaborators
Loading Guangdong Engineering Laboratory of Digital Home Interactive Applications collaborators