全部

1·In computational geometry, computing cross products is at the heart of line-segment methods.

叉积是计算几何中关于线段算法的核心。

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

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

3·Yes, convex hull is at the kernel of computational geometry and serves as a fundamental geometric structure.

是的，凸包是计算几何的核心问题，也是一种基础性的几何结构。

4·Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.

凸包问题是计算几何的基本问题之一，在许多领域均有应用。

5·Finally, some of the author's viewpoints on computational geometry on modern parallel computers are presented.

最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。

6·Utilizing related algorithms of computational geometry to triangulate TIN partly to make node and line as vertex and side of triangles.

利用计算几何的相关算法，把矢量数据的节点和边界线作为TIN网三角形的端点和边，对TIN网的局部进行三角化。

7·Triangulation is widely used in geology, computational geometry, graphics, images, and many other science and biomedical and other fields.

三角网剖分技术在地质学、计算几何学、图形图像学和生物医学等众多领域得到广泛的应用。

8·He is the author of numerous conference papers and journal publications on the topics of computational geometry, algorithms, and data structures.

他是众多会议论文的作者和期刊出版物在计算几何的主题，算法和数据结构。

9·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.

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

10·On the basis of helicoid theory and computational geometry, the sectional contours of a sample twist drill were found for producing similar twis1t drills.

本文利用螺旋面理论。结合计算几何知识，根据-麻花钻实物求出了加工该工件用的二次圆盘刀具截形。