Premium
Surface triangulation over intersecting geometries
Author(s) -
Shostko Alexander A.,
Löhner Rainald,
Sandberg William C.
Publication year - 1999
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19990330)44:9<1359::aid-nme552>3.0.co;2-b
Subject(s) - triangulation , intersection (aeronautics) , polygon mesh , surface (topology) , computation , volume mesh , mesh generation , visualization , computational science , surface triangulation , marching cubes , computer science , algorithm , geometry , computer graphics (images) , mathematics , finite element method , constrained delaunay triangulation , engineering , delaunay triangulation , artificial intelligence , structural engineering , aerospace engineering
A method for the rapid construction of meshes over intersecting triangulated shapes is described. The method is based on an algorithm that automatically generates a surface mesh from intersecting triangulated surfaces by means of Boolean intersection/union operations. After the intersection of individual components is obtained, the exposed surface parts are extracted. The algorithm is intended for rapid interactive construction of non‐trivial surfaces in engineering design, manufacturing, visualization and molecular modelling applications. Techniques to make the method fast and general are described. The proposed algorithm is demonstrated on a number of examples, including intersections of multiple spheres, planes and general engineering shapes, as well as generation of surface and volume meshes around clusters of intersecting components followed by the computation of flow field parameters. Copyright © 1999 John Wiley & Sons, Ltd.