Discontinuity is considered in the gridding algorithm of geologic surfaces by breaking the linkage between grid nodes which cross the line of discontinuity in the similar manner to Bolondi
et al. (1976) . Shiono
et al. (1986, 1987) proposed a gridding algorithm for numerical determination of the optimal continuous surface:
z=f (x, y) .In this algorithm, the smoothest function is chosen among many feasible functions which satisfy elevation data as well as dip and strike-data, using a functional:
J (f) =m1J1 (f) +m2J2 (f) as a measure of smoothness of the function
f (x, y) . Applying Bolondi
et al. (1976) 's idea to the algorithm, Noto
et al. (1988) developed a N
88-BASIC program for gridding of a faulted surface, in which discontinuity of surface is realized by neglecting terms of
J1 (f) and/or
J2 (f) related to neighboring nodes located on both sides of the line of discontinuity. However, the program has some limitations due to its restricted use of computer memory and low processing speed. Expanding the algorithm proposed by Noto
et al. (1988), we deveolped a FORTRAN program to determine optimal shapes of not only discontinuous surfaces but also surfaces including discontinuity of partial derivative of first order. This program realizes both rapid processing and expansion of gridding area.
View full abstract