Generating computational grids using implicit functions (Q1802578)

A method of grid construction for domains with boundary described by a differential implicit function \(F(x,y,z) = 0\) is considered. The mesh of nodes consists of surfaces \(F(x,y,z) = a_ i\), \(i = 1,2,\dots,n\), and orthogonal paths (i.e. parallel to \(\text{grad }F\)). The method is developed for the union and intersection of such domains. More complicated domains may be approximated by implicit differential functions, using an algorithm suggested by the author. Vectorization of the grid construction algorithm is its significant advantage for an application to parallel computers. Some time estimations for VAX-750 computers are mentioned.