Sentence examples for partitioning of space from inspiring English sources

For this purpose, we have selected stochastic tessellations of the Poisson, Voronoi and Box type, which provide convenient models for the random partitioning of space, and we have generated an ensemble of assembly realizations; for each geometry realization, criticality calculations have been performed by using the Monte Carlo code Tripoli-4®, developed at CEA.

These two algorithms allowed an unbiased comparison of continuous place field activity distributions and discrete partitioning of space.

To convert continuous place field activity distributions to a discrete partitioning of space, we applied a winner-take-all process.

Newman uses a sector technique that maintains a look-up table of the list of elements located within a discrete partitioning of space, elements then just need to perform calculations with elements in the neighboring sectors.

Hirshfeld surfaces are produced through the partitioning of space within a crystal where the ratio of promolecule to procrystal electron densities is equal to 0.5, resulting in continuous, nonoverlapping surfaces.

In terms of image, the result of a quadtree represents a partition of space in two dimensions by decomposing the image into four equal quadrants, subquadrants, recursively.

The introduction of v0 divides the rectangle V into three areas:  A′ and A′′ is a set of vectors incomparable with IΓ ∪ , Figure 1 A space  V  of incomparable vectors bounded by coordinates vectors w 1, w2 ∈ I Γ. Figure 2 A partition of space  V  when a new vector  γ is introduced.

Voronoi Tessellation is a partition of space into polyhedra, whereas Delaunay diagram builds a graph with vertices at atoms.

Based on the partition of state space on the nonnegative orthant, sufficient conditions in terms of linear programming are obtained to guarantee such system to be asymptotically stable.

Following the previous results, a sufficient condition is obtained for stability of switched nonlinear homogeneous systems, and a switching law is designed by partition of state space.

Recall the set from Section 2.1, that is, the partition of state space of delay (or queue) where Log rule and PF take the same scheduling decision.