Sentence examples for planar set from inspiring English sources

This paper presents an algorithm for robustly approximating the boundary of a domain, latent in a planar set of scattered points, by a B-spline curve.

We compute the Bass stable rank of the algebra A(K sym of real-symmetric functions that are continuous on symmetric compact planar sets K and holomorphic in the interior K∘ of K.

The planar data set for POD analysis was obtained from particle image velocimetry (PIV) and large eddy simulation (LES) studies.

The convex hull is found by Graham algorithm, which mainly includes the following steps: In an arbitrary planar point set, after sorting and scanning, its convex hull is shown as Figs. 3 and 4 show the circular data and its convex hull.

We fair and fit planar point sets by minimal-energy arc splines.

Our goal is to design algorithms that give a linearity measure for planar point sets.

Thereby, a higher accuracy can be achieved than by state-of-the-art planar imaging set-ups.

The main problems will be introduced and an experimental simulation will prove the robustness of a slightly modified version of a well known method for the reconstruction of binary planar convex sets, even in case of projections affected by error.

This paper deals with the problem of C2 cubic spline interpolation under geometric boundary conditions, that is, fixing the unit-tangent vector and the curvature at the end points of a planar point-set.

Indeed, the case of planar convex sets was already studied by Bernstein [13] in 1905 and by Bonnesen [21] in 1924, see Theorem 1.1 in Sect. 1.

Volumetric data sets were reconstructed into standard anatomic orientations, and all attempts were made to duplicate standard in vivo slice orientation for planar data sets.