“…where the arguments in t min (x) = t min (x; P, T, K, R) are dropped to simplify the notation, and the common intersection is factored out of the union. For computational purposes, it is more practical to invert the dictionary look-up from query points to the corresponding minimal-collision sharp points in (13). For a given sharp point k ∈ K, let Q(k; O, P, T, K, R) stand for the subset of all inaccessible points x ∈ I(O, T, K, R) for which k = k min (x; P, T, K, R).…”