The examination of method to describe mathematically geological information observed at ou tcrops is necessary to construct outcrops database. For the purpose, we propose the structure graph and the stratigraphic graph by using the graph theory and the binary relation, and examine their theoretical background. We suppose that the geological structures have no upturned layers, and that there are no cuttings by fault and no penetrations of igneous rocks. The outcrop structure as the contact relations among beds can be expressed in the terms of binary relation
xRy which means two beds
x and
y contact each other and
y overlain
x. This relation is expressed as a labeled directed graph
G = (
V,
R), where
V is a set of beds observed at an outcrop. We call this graph the structure graph. The stratigraphic sequence is the sedimentary order of beds, and this sequence is expressed in terms of binary relation
xU*y, which means
x is older than
y.Symbol
U* is a reflexive and transitive closure of the binary relation
xRy, and the graph
S = (
V,
U* ) is called a strtigraphic graph. By this technique, we can make clear difference between outcrop structure and outcrop stratigraphic sequence mathematically. The stratigraphic sequence observed at an outcrop is a partial ordering and it may not necessarily be total ordering. The work to construct the local stratigrphic sequence of a certain area from structure observed at plural outcrops is formulated as the operation of the outcrop stratigraphic graphs. Thus we can mathematically express the geological structure and the stratigraphic sequence.
View full abstract