• Aucun résultat trouvé

Minimal arithmetic thickness connecting discrete planes

N/A
N/A
Protected

Academic year: 2021

Partager "Minimal arithmetic thickness connecting discrete planes"

Copied!
17
0
0

Texte intégral

Loading

Figure

Figure 1: Connected arithmetic discrete planes (with normal vector n = (9, 14, 31)) thinner than the naive one.
Figure 2: The action of Ψ 2 on two 2-adjacent voxels of P (n, ω).
Figure 3: The action of Ψ e 2 on two 2-adjacent voxels of P (m, ω + n 1 ).
Figure 4: The action of Ψ e 1 on two 2-adjacent voxels of P .

Références

Documents relatifs

In the CADNA library, an integer variable named accuracy is associated with any stochastic number to store its number of exact significant digits. Thanks to this variable, the

• We detail how this algorithm can be used for digital shape analysis. We show how to detect convex/concave/inflexion zones onto a digital surface... • For some well-identified

– The second is that the acceptable preva- lence (i.e., the maximum prevalence rate of the disease that one accepts to detect with a confidence lower than a given threshold, e.g. 95

The proposed approach uses interval arithmetic to build a graph which has exactly the same number of connected components than S.. Examples illustrate the principle of

Dynamical control of converging sequences using Discrete Stochastic Arithmetic..

For each type configuration considered, PROMISE tests if the associated computed result satisfies the requested accuracy. A comparison with a high precision reference result

According to Theorem 163, the words labeling loops rooted at the zero-state of a zero-SCC are the encodings (from which the sign symbol o has been removed) of the natural solutions of

As a matter of fact, our arguments remain valid in a larger context: we characterize all bounded arithmetic functions orthogonal to all topological systems whose all ergodic