# planar point

## planar point

[′plā·nər or ′plā·när ‚pȯint]
(mathematics)
A point on a surface at which the curvatures of all the normal sections vanish.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
Figure 6(b) shows the procedure of finding a planar patch as the correspondence of a planar point, where (j, l, m) forms the correspondence of point i, i [member of] [[??].sub.k+1].
For a planar point [mathematical expression not reproducible] is the corresponding planar patch [mathematical expression not reproducible], then the point to plane distance is
Caption: Figure 6: (a) Finding corresponding edge point and edge line; (b) finding corresponding planar point and planar patch.
Pinter, On the number of rectangulations of a planar point set, J.
Seidel, A better upper bound on the number of triangulations of a planar point set, J.
Welzl, Random triangulations of planar point sets, Proc.
Convex hull of a planar point set S is defined as the intersection of all the half-planes containing S.
Let Q = {[q.sub.1], [q.sub.2] , ..., [q.sub.M]} be a planar point set.
In the planar point set Q, [Q.sub.xy]), [Q.sub.xY], [Q.sub.Xy], [Q.sub.XY], [Q.sub.yx], [Q.sub.yX], [Q.sub.Yx] and [Q.sub.YX] are the extreme points of the convex hull, where [Q.sub.xy] and [Q.sub.xY], [Q.sub.Xy], and [Q.sub.XY], [Q.sub.yx] and [Q.sub.yX], [Q.sub.Yx], and [Q.sub.YX] are the homogeneous extreme points, respectively.
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex bull of P, such as membership and tangent-finding.
 used Overmars and van Leeuwen's data structure to maintain an approximate width of a dynamic planar point set.
An arbitrary collection of planar points, defined by their coordinates (x, y), is considered as the input for the algorithm.
Site: Follow: Share:
Open / Close