Sentence examples for both point sets in from inspiring English sources

Moreover, a bidirectional expectation maximization (EM) process is introduced to update both point sets in contrast to traditional methods.

We present algorithms that preserve the collinearity and coplanarity relationships among point sets in three dimensions.

We propose an algorithm for computing the exact minimum enclosing ball of large point sets in general dimensions.

A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in RD.

The point group identification (PGI) algorithm is proposed to determine the representative point sets in response analysis of nonlinear stochastic dynamic systems.

This leads us to a wavelet frame based model, as well as a fast algorithm, to reconstruct implicit surfaces from unorganized point sets in R3.

We design efficient data structures for dynamically maintaining a ham-sandwich cut of two point sets in the plane subject to insertions and deletions of points in either set.

Let A = { a1,..., a m } and B = { b1,..., b n } be finite point sets in a Euclidean space.

Performing a superposition requires a one-to-one correspondence, or alignment, of the point sets in the different structures.

One idea is key: Kandinsky's proposition that a line is a point set in motion.

One is key: Wassily Kandinsky's proposition that a line is a point set in motion.