In computational geometry, computing cross products is at the heart of line-segment methods.
叉积是计算几何中关于线段算法的核心。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
Yes, convex hull is at the kernel of computational geometry and serves as a fundamental geometric structure.
是的，凸包是计算几何的核心问题，也是一种基础性的几何结构。
Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.
凸包问题是计算几何的基本问题之一，在许多领域均有应用。
Finally, some of the author's viewpoints on computational geometry on modern parallel computers are presented.
最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。
Utilizing related algorithms of computational geometry to triangulate TIN partly to make node and line as vertex and side of triangles.
利用计算几何的相关算法，把矢量数据的节点和边界线作为TIN网三角形的端点和边，对TIN网的局部进行三角化。
Triangulation is widely used in geology, computational geometry, graphics, images, and many other science and biomedical and other fields.
三角网剖分技术在地质学、计算几何学、图形图像学和生物医学等众多领域得到广泛的应用。
He is the author of numerous conference papers and journal publications on the topics of computational geometry, algorithms, and data structures.
他是众多会议论文的作者和期刊出版物在计算几何的主题，算法和数据结构。
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.
讨论了计算几何学中的矩形条覆盖问题，提出解决该问题的一个有效算法，并对提出的算法进行了分析。
On the basis of helicoid theory and computational geometry, the sectional contours of a sample twist drill were found for producing similar twis1t drills.
本文利用螺旋面理论。结合计算几何知识，根据-麻花钻实物求出了加工该工件用的二次圆盘刀具截形。
A method is presented by using computational geometry techniques to determine optimal tool position and orientation for 5-axis machining with torus end-mill.
应用计算几何技术来决定优化的刀具定位和刀具姿态以实现环形刀的5轴自由曲面数控加工。
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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
By making use of the proximity query method in computational geometry, the whole matching query, pattern query, inverse query and outlier detection in time series are studied.
提出了计算几何应用到时间序列挖掘的方法，实现了时间序列全序列匹配查询、模式查询、反向查询和异常检测，查询效率和准确性都有了比较大的提高。
This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm, polygon filling algorithm based on monotony chain.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
The triangulation of constrained data set is widely used in Geographic Information System (GIS), geo-science, computational geometry, multi-resolution and high precision DTM, et al.
顾及地形特征线的散点域(约束数据域)三角剖分是建立高精度数字地面模型的基础，在GIS、地学分析、计算几何、多分辨率DTM等领域中有着广泛的应用。
This paper presents a coverage-enhancing algorithm for non-isomorphic node network based on virtual force, which consists of computational geometry and improved virtual force algorithm.
该文提出一种基于虚拟力的异构节点网络覆盖增强算法，该算法由计算几何和改进的虚拟力算法组成。
The range of local body-fitting coordinate mesh adjacent to the wall with special geometry should not be too wide or extended, or it would cause the aberration of computational results.
特殊几何形状壁面附近局部贴体坐标网格的范围不宜太大，否则会引起计算结果的畸变。
Using this computational format the transformation frame multiple-dimensional problem with complex geometry shape into one-dimensional problem is realized, so that computation precision is increased.
在该计算格式中，实现了几何形状复杂的多维问题向一维问题的转换，从而提高了有限元离散节点的计算精度。
The design was developed through custom computational protocols of structural formfinding, descriptive geometry, and stress flowdriven porosity.
这项设计通过自定义的计算协议结构塑形，画法几何和应力穿孔技术被开发出来。
From the description of complexity and the information facts, has produced the general computational method on geometry knowledge measurement of mechanical component.
本文以制造知识中几何知识为例，从描述复杂度和信息量的角度，给出了机械加工零件几何知识计量的一般计算方法。
The preconditioner is generated from the target's "geometry structure " and not from the "matrix element", which assured the computational complexity for generating the preconditioner is only O(N) .
在构造预条件因子时，采用从目标的“几何结构剖分”出发，而不是从“矩阵元素”出发确定“基权函数之间的作用量关系”，这样保证了构造预条件矩阵的计算复杂度仅为O（N）。
Topics covered range from computational complexity, algebraic geometry, dynamics, through to number theory and quantum groups.
直达数论和量组，题目由于计算的复杂性，代数学的几何学，力学包括范围。
Topics covered range from computational complexity, algebraic geometry, dynamics, through to number theory and quantum groups.
直达数论和量组，题目由于计算的复杂性，代数学的几何学，力学包括范围。
应用推荐