Polyhedrization of an arbitrary 3D point set

被引:57
作者
Idelsohn, SR [1 ]
Calvo, N
Oñate, E
机构
[1] Univ Nacl Litoral, INTEC, CIMEC, Int Ctr Computat Methods Engn, RA-3000 Santa Fe, Argentina
[2] Consejo Nacl Invest Cient & Tecn, RA-3000 Santa Fe, Argentina
[3] Univ Politecn Cataluna, CIMNE, Int Ctr Numer Methods Engn, Barcelona 088034, Spain
关键词
polyhedral mesh generation; particles methods; Lagrangian formulations; Delaunay; Voronoi;
D O I
10.1016/S0045-7825(03)00298-6
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Given a 3D point set, the problem of defining the volume associated, dividing it into a set of regions (elements) and defining a boundary surface is tackled. Several physical problems need to define volume domains, boundary surfaces and approximating functions from a given point distribution. This is for instance the case of particle methods, in which all the information is the particle positions and there are not boundary surfaces definition. Until recently, all the FEM mesh generators were limited to the generation of simple elements as tetrahedral or hexahedral elements (or triangular and quadrangular in 2D problems). The reason of this limitation was the lack of any acceptable shape function to be used in other kind of geometrical elements. Nowadays, there are several acceptable shape functions for a very large class of polyhedra. These new shape functions, together with a generalization of the Delaunay tessellation presented in this paper, gives an optimal marriage and a powerful tool to solve a large variety of physical problems by numerical methods. The domain partition into polyhedra presented here is not a standard mesh generation. The problem here is: for a given node distribution to find a suitable boundary surface and a suitable mesh to be used in the solution of a physical problem by a numerical method. To include new nodes or change their positions is not allowed. (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:2649 / 2667
页数:19
相关论文
共 34 条
[1]  
Akkiraju N., 1995, P 1 INT COMP GEOM SO, V63
[2]   Finite cloud method: a true meshless technique based on a fixed reproducing kernel approximation [J].
Aluru, NR ;
Li, G .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2001, 50 (10) :2373-2410
[3]  
BELIKOV V, 1998, NUMERICAL GRID GENER
[4]  
BERN M, 2000, MESH GENERATION HDB
[5]  
BONET J, 1999, INT J NUMER METHODS
[6]   COMPUTING DIRICHLET TESSELLATIONS [J].
BOWYER, A .
COMPUTER JOURNAL, 1981, 24 (02) :162-166
[7]   All-hexahedral mesh smoothing with a node-based measure of quality [J].
Calvo, NA ;
Idelsohn, SR .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2001, 50 (08) :1957-1967
[8]   All-hexahedral element meshing: Generation of the dual mesh by recurrent subdivision [J].
Calvo, NA ;
Idelsohn, SR .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 182 (3-4) :371-378
[9]  
*CIMNE, 2002, GID PERS PRE POST PR
[10]  
CISILINO AP, 2002, MECANICA COMPUT, V21