We propose a bitwise operation useful to perform set operations related to the logical model of geologic structure. Let S be a surface dividing a 3D region Ω into two subspaces. We partition Ω into three mutually prime subspaces: S itself, the upper half-space S+ and the lower one S− and assign a three-digit binary number to each of eight subsapces generated by S. Then a
set of the subsapces is Boolean isomorphic to a set
of three-digit binary numbers, and so operations on such as intersection, union and complement can be replaced by corresponding bitwise operations on
. Given sufaces S1, …, Sn, a subspace defined as intersection of subspaces generated by each surface is uniquely corresponded to a n-tuple (x1, …, xn) ∈
n, denoted by p(x1, …, xn). Operations such as union, intersection and complement of subaspaces can be replaced by corresponding bitwise operations of elements in the n-tuple. The procedures are generalized in the form of operation rules. Efficiency of the operation method is verified through application to the logical model of geologic structure defined by four boundary surfces.
View full abstract