• It is a good idea to already have your break point set in the agent code.

    最好是代理代码中已经设置了断点。

    youdao

  • Constructing convex hull of planar point set is a basic algorithm in computational geometry.

    求平面点集的凸包是计算几何的一个基本算法。

    youdao

  • A deformable mesh model was presented for surface reconstruction from a finite 3d point set.

    针对有限三维点集的表面重构问题,提出一种可变形网格模型的建模方法。

    youdao

  • This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.

    提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法,新的算法能够避免极值点重合的问题。

    youdao

  • In chapter 3, the local structure of a scattered point set and its classical algorithms are investigated.

    第三章研究了散乱点集的邻域结构及其经典算法。

    youdao

  • A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented.

    提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。

    youdao

  • The unified mathematical model for evaluating geometrical errors is created with the theory of point set topology.

    用点集拓扑学理论,建立了形位误差评定的统一数学模型。

    youdao

  • Thirdly, the feature point set is filtered by the rule and two-step curve fitting method is used to obtain the dental arch form.

    然后基于规则筛选出关键特征点集,通过两步最小二乘法拟合牙弓线。

    youdao

  • Research on digital watermarking algorithms for the 3d mesh model in the spatial domain and 3d shape model defined as a point set is made.

    本论文分析了三维几何模型数字水印的基本原理和方法,研究了空域中的三维网格水印算法和三维点集模型的水印算法。

    youdao

  • This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry.

    讨论了计算几何学中的矩形条覆盖问题,提出解决该问题的一个有效算法,并对提出的算法进行了分析。

    youdao

  • This paper proposes a novel algorithm for surface-based hierarchical clustering simplification that aims to accelerate view-dependent point set rendering.

    针对点曲面的视点相关绘制问题,提出了一个新的表面基层次聚类简化算法。

    youdao

  • Neural networks for problems of the global optimization are proposed in this paper and the global convergence of the equilibrium point set is also proven.

    给出总体极小化问题的神经网络模型,分析了网络的电路实现。

    youdao

  • Firstly, we detect the points of interest in a pair of images in image sequence, and then match the point set using the gray value differential invariants.

    首先在序列的两幅图像中检测兴趣点,并运用灰度差分不变量进行两点集之间的匹配。

    youdao

  • The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).

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

    youdao

  • Surface data points are important for realizing products' computer-aided applications. CAM methods based on surface data point set are researched in this paper.

    产品表面数据是计算机辅助应用的重要前提,研究了基于表面数据点集的产品CAM方法。

    youdao

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

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

    youdao

  • Firstly, RAC and K-means clustering method are combined in this algorithm by the way of searching pre-matches feature points, which are called the cluster point set, of the unknown model.

    此算法首先结合RAC和K -均值聚类方法对未知模型的特征点进行预匹配,得到的匹配结果称为聚类点集。

    youdao

  • During stereo matching, the feature points whose correlation coefficients are within certain range less than the maximal coefficient can be taken as an original matching feature point set.

    在立体匹配时,将灰度相关系数小于最大灰度相关系数一定范围内的特征点作为灰度相关复峰初始匹配特征点集合。

    youdao

  • Step one is to pick up the control point set which determines the geometric position of images, and then to derive a geometric transform for registering one image to another from those points.

    交互式数字图象的配准与镶嵌主要由二个步骤来完成:第一步是由人在显示屏幕上选择确定图像几何位置的控制点集,然后由此确定一幅图像几何变换使两幅图像在几何位置上配准。

    youdao

  • In this paper, we show that the Pseudo-Symmetric property of spherical point set can be characterized by the eigen values of eigenpolynomial and it has the closeness under the metric sum operation.

    本文证明了球面有限点集的伪对称性可以完全由其特征多项式的根来刻画,并得到了在度量加运算下伪对称性具有封闭性。

    youdao

  • In this paper, by using iterative procedure, the authors investigate generation of point set sequences for the algorithm, especially the integration of irregular geometric models with regular ones.

    研究了点集序列迭代生成的计算机算法,强调非规则几何对象与规则几何对象造型格式的统一。

    youdao

  • Aimed at the limitations of clustering of the traditional calculation of similarity based on distance, a method of point-set clustering based on topology geometry-figure is proposed.

    针对传统的基于距离计算相似性聚类方法的局限性,提出一种基于几何形状的点集聚类方法。

    youdao

  • This paper evolves the measure of the system parameter corresponding to the bifurcation point (set) in parameter space and sets up the mathematical expression formula of the potential of accident.

    在参量空间,论文以分岔点(集)为参照导出对系统参量的度量,建立事故潜势的数学表达式。

    youdao

  • This paper evolves the measure of the system parameter corresponding to the bifurcation point (set) in parameter space and sets up the mathematical expression formula of the potential of accident.

    在参量空间,论文以分岔点(集)为参照导出对系统参量的度量,建立事故潜势的数学表达式。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定