NC code or STL file can be generated directly from measuring data in a fastreverse-engineering mode. Compressing the massive data from laser scanner is the key of the newmode. An adaptive compression method based on t...NC code or STL file can be generated directly from measuring data in a fastreverse-engineering mode. Compressing the massive data from laser scanner is the key of the newmode. An adaptive compression method based on triangulated-surfaces model is put forward.Normal-vector angles between triangles are computed to find prime vertices for removal. Ring datastructure is adopted to save massive data effectively. It allows the efficient retrieval of allneighboring vertices and triangles of a given vertices. To avoid long and thin triangles, a newre-triangulation approach based on normalized minimum-vertex-distance is proposed, in which thevertex distance and interior angle of triangle are considered. Results indicate that the compressionmethod has high efficiency and can get reliable precision. The method can be applied in fastreverse engineering to acquire an optimal subset of the original massive data.展开更多
A region-growing method for reconstructing triangulated surfaces from massive unorganized points is presented. To save memory space, a ring data structure is adopted to build connections between points and triangulate...A region-growing method for reconstructing triangulated surfaces from massive unorganized points is presented. To save memory space, a ring data structure is adopted to build connections between points and triangulated surfaces. The data-structure allows the efficient retrieval of all neighboring vertices and triangles of a given vertice, To narrow the search range of adjacent points and avoid tuangle intersection, an influence area is defined for each active-edge, In the region-growing process of triangulated surfaces, a minimum-edge-angle-product algorithm is put forward to select an appropriate point to form a new triangle for an active edge. Results indicate that the presented method has high efficiency and needs less memory space, optimized triangulated surfaces with reliable topological quality can be obtained after triangulation,展开更多
In this article we define a surface finite element method （SFEM） for the numerical solution of parabolic partial differential equations on hypersurfaces F in R^n＋1. The key idea is based on the approximation of F b...In this article we define a surface finite element method （SFEM） for the numerical solution of parabolic partial differential equations on hypersurfaces F in R^n＋1. The key idea is based on the approximation of F by a polyhedral surface Гh consisting of a union of simplices （triangles for n = 2, intervals for n = 1） with vertices on Г. A finite element space of functions is then defined by taking the continuous functions on Гh which are linear affine on each simplex of the polygonal surface. We use surface gradients to define weak forms of elliptic operators and naturally generate weak formulations of elliptic and parabolic equations on Г. Our finite element method is applied to weak forms of the equations. The computation of the mass and element stiffness matrices are simple and straightforward. We give an example of error bounds in the case of semi-discretization in space for a fourth order linear problem. Numerical experiments are described for several linear and nonlinear partial differential equations. In particular the power of the method is demorrstrated by employing it to solve highly nonlinear second and fourth order problems such as surface Allen-Cahn and Cahn-Hilliard equations and surface level set equations for geodesic mean curvature flow.展开更多
基金This project is supported by Provincial Key Project of Science and Technology of Zhejiang(No.2003C21031).
文摘NC code or STL file can be generated directly from measuring data in a fastreverse-engineering mode. Compressing the massive data from laser scanner is the key of the newmode. An adaptive compression method based on triangulated-surfaces model is put forward.Normal-vector angles between triangles are computed to find prime vertices for removal. Ring datastructure is adopted to save massive data effectively. It allows the efficient retrieval of allneighboring vertices and triangles of a given vertices. To avoid long and thin triangles, a newre-triangulation approach based on normalized minimum-vertex-distance is proposed, in which thevertex distance and interior angle of triangle are considered. Results indicate that the compressionmethod has high efficiency and can get reliable precision. The method can be applied in fastreverse engineering to acquire an optimal subset of the original massive data.
文摘A region-growing method for reconstructing triangulated surfaces from massive unorganized points is presented. To save memory space, a ring data structure is adopted to build connections between points and triangulated surfaces. The data-structure allows the efficient retrieval of all neighboring vertices and triangles of a given vertice, To narrow the search range of adjacent points and avoid tuangle intersection, an influence area is defined for each active-edge, In the region-growing process of triangulated surfaces, a minimum-edge-angle-product algorithm is put forward to select an appropriate point to form a new triangle for an active edge. Results indicate that the presented method has high efficiency and needs less memory space, optimized triangulated surfaces with reliable topological quality can be obtained after triangulation,
文摘In this article we define a surface finite element method （SFEM） for the numerical solution of parabolic partial differential equations on hypersurfaces F in R^n＋1. The key idea is based on the approximation of F by a polyhedral surface Гh consisting of a union of simplices （triangles for n = 2, intervals for n = 1） with vertices on Г. A finite element space of functions is then defined by taking the continuous functions on Гh which are linear affine on each simplex of the polygonal surface. We use surface gradients to define weak forms of elliptic operators and naturally generate weak formulations of elliptic and parabolic equations on Г. Our finite element method is applied to weak forms of the equations. The computation of the mass and element stiffness matrices are simple and straightforward. We give an example of error bounds in the case of semi-discretization in space for a fourth order linear problem. Numerical experiments are described for several linear and nonlinear partial differential equations. In particular the power of the method is demorrstrated by employing it to solve highly nonlinear second and fourth order problems such as surface Allen-Cahn and Cahn-Hilliard equations and surface level set equations for geodesic mean curvature flow.
