An Algorithm for Projecting Points onto a Patched CAD Model |
| |
Authors: | W D Henshaw |
| |
Affiliation: | (1) Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA, US |
| |
Abstract: | We are interested in building structured overlap-ping grids for geometries defined by Computer-Aided-Design (CAD) packages.
Geometric information defining the boundary surfaces of a computation domain is often provided in the form of a collection
of possibly hundreds of trimmed patches. The first step in building an overlapping volume grid on such a geometry is to build
overlapping surface grids. A surface grid is typically built using hyperbolic grid generation; starting from a curve on the
surface, a grid is grown by marching over the surface. A given hyperbolic grid will typically cover many of the underlying
CAD surface patches. The fundamental operation needed for building surface grids is that of projecting a point in space onto
the closest point on the CAD surface. We describe a fast and robust algorithm for performing this projection which makes use
of a fairly coarse global triangulation of the CAD geometry. Before the global triangulation is constructed the connectivity
of the model is determined by an edge-matching algorithm which corrects for gaps and overlaps between neighbouring patches.
ID="A1" Correspondence and offprint requests to: Dr. W. D. Henshaw, Center for Applied Scientific Computing, L-661, Lawrence Livermore National Laboratory, Livermore, CA
94551, USA. E-mail: henshaw@llnl.gov |
| |
Keywords: | : CAD models Grid generation Hyperbolic Overlapping grids Surface grids |
本文献已被 SpringerLink 等数据库收录! |
|