查询词典 planar point

Given a planar point set,the moving least squaremethod is adopted to denoise and resample it so that the resulting point set is with low noise and uniform sampling density.Then the reliable signed distance field of the preprocessed point set is constructed by using the Level Set method.Finally,an algebraic B-spline function is adopted to fit the signed distance field by solving a linear equation system.

首先给定一个表示封闭曲线、可能带有噪音且分布不均匀的平面点云，采用移动最小平方(moving least square，简称MLS)方法对点云去噪、重采样，得到一个低噪音、分布均匀的"线状"点云，再通过Level Set方法建立该"线状"点云的离散几何距离场，最后用一个代数B-样条函数光顺拟合该离散距离场，代数函数的零点集即为重建曲线。

It is obviously that a planar point set has innumerable circumscribled circles. To get a minimum circumscribled circle, a mathematical model is built to transform the problem of getting a minimum circumscribled circle to the problem of optimizing function and to solve the function optimization with genetic algorithm.

为求得最小的包容圆，建立了求平面点列包容圆的数学模型，将求最小包容圆问题转化为函数优化问题，并用遗传算法解决了这个函数最优解的求解问题。

The main contents of this course include: complex number and planar point set, function of complex variable, complex integral, series, residue, conformal mapping, analytic extension, harmonic function.

本课程的基本内容有：复数与平面点集、复变函数、复积分、级数、留数、保形映射、解析开拓、调和函数。

The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set.

提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法。

The minimum weight triangulation of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.

平面点集的最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。

External incremental algorithm for Voronoi diagram of massive planar point sets was further developed.

进一步发展平面点集Voronoi图的增量式外置算法。

Planar point set the minimum inclusive circle, that circle with a minimum point of the plane are all incorporated.

详细说明：平面点集的最小包容圆，即用一个最小的圆把平面内所有的点都包容在内。

Closest point to the problem is for two-dimensional coordinates of the point of the problem, the algorithm is to be planar point set on the S linear divided roughly equal to the size of two sub-sets of S1 and S2, we selected a vertical line l : x = m as a separate line.

最接近点对问题是求二维坐标中的点对问题，该算法是为了将平面上点集S线性分割为大小大致相等的2个子集S1和S2，我们选取一垂直线l：x=m来作为分割直线。

To compute the convex hull of a planar point set, first to find the extreme points of the planar point set and get the sub collections of points candidate for vertices of the convex hull between them.

新算法达到目前平面点集凸包问题的渐进最好算法的时间复杂度O，其中，n为平面点集的点数，h为平面点集凸包的顶点数。

When the edges of a convex polygon are traversed along one direction, the interior of the convex polygon is always on the same side of these edges, a new algorithm for computing the convex hull of a simple polygon is proposed first, which is then extended to a new algorithm for computing the convex hull of a planar point set.

本文依据凸多边形的这一特性，提出求解简单多边形凸包的新算法，进而扩展得到求解平面点集凸包的新算法。新点集凸包算法先找到点集的极值点，得到极值点间的候选点子集，再求得相邻极值点间的有序凸包点列，最后顺序连接极值点间的有序凸包点列，得到凸包。

It is also known as one of the most poisonous naturally occurring substances.

它也被称为一个最自然发生的有毒物质。

The greatest stress is found at the location on the cross section where V is the largest.

最大应力出现在横截面上V为最大的地方。