that contains p,
where p is a point or degenerate set. If
for values precisely equal to a data reading).
Let p be a criticality and let q be a saddle or minimum criticality with value f(q)< f(p), such that the following properties uniquely hold:
1) for all
between f(p) and f(q),
,
and there does not exist a criticality r, with
f(p) > f(r) > f(q), such that
.
2) For each
,
.
Then q is the parent of p, and is there is a directed edge from p to q.
In rare cases, we must ``break ties'' arbitrarily.
If there is more than one criticality that satisfies the above two properties
(and thus has the same value f(q)), let us call this collection Q.
Arbitrarily order Q, with enumeration qi,
,
select q0 as parent of p,
and set qi+1 as the parent of qi, for each
.
Note that the second (tie breaking) case is just for the rare situation in which one object merges with several others at precisely the same value.
The criticality graph, together with the associated zones,
represent all possible topologically
distinct level set objects (components of
,
ranging over all
)
very succinctly.
As we decrease the threshold from a critical value, with associated criticality
p,
the object containing p grows and deforms. When another critical value, with associated criticality
q, is reached, the object changes in topology. We then make q the parent of p.
The zone of a criticality is the volume swept by the boundary manifolds
of a level set component, as the threshold
is varied over the interval
of values for which this component remains topologically invariant.
See figure 19 through figure 24 for an example of the criticality graph and associated zones,
for a simple dataset.