Let
be the object containing p at threshold .
For
equal to a data value define
to be the closure
of
(note that this second case
is a technicality since
our axioms have not defined
for values precisely equal to a data reading).
The vertices of the criticality tree are the criticalities
with a parent pointer edge from a criticality p with value xp
to criticality
q, with value xq, if as the threshold is decreased
q is the first criticality that becomes
part of the same object as p, i.e.,
and there is no criticality r (with value
xr) such that
xq < xr < xp and
.
For a given criticality p with parent q, the topological
zone of p, denoted
,
is the set difference
Op ( f(q)) - Op ( f(p) ). The toplogical zone components are
just the connected copmponents of .
Note that when we do not assume data uniqueness, a given object may merge
with several criticalities simultaneously, and we just arbitrarily order the parentage
of
these to break the ties.