多边形三角剖分是计算几何的一个几何基元。
Triangulate partitioning polygon is geometric primitives of computational geometric.
提出了一种针对空间封闭点云的三角剖分算法。
This paper puts forward a triangulation algorithm used for space closed point-cloud.
应用三角剖分、引入面积坐标来求出方程的近似解。
The triangular elements and area coordinates are used to solve the numeric solution.
根据STL文件的特点，建立了一个有效的截面三角剖分算法。
An effective triangle -meshing algorithm of sections based on STL file form at is set up.
与基于中轴的三角剖分算法相比，该文算法需要更少和更简单的计算。
In contrast with the local triangulation algorithm, the algorithm in this paper is more powerful to avoid surface self intersection.
实现这一方法的关键就是对人体曲面上的散乱数据点进行有效的三角剖分。
The key of applying this new method was the effective triangular subdivision of mass data point of human body model.
在三维重建方面，利用经典的三角剖分方法实现了股骨头软骨的表面重建。
On the aspects of 3d reconstruction, the classical triangulation methods were used to reconstruct the surfaces of the femoral head cartilage.
为了实现有效的三角剖分，采用了基于空间体的散乱数据点的三角剖分技术。
In order to perform effective triangulation, the technology of tetrahedron-based triangulation of scattered dada was adopted.
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
建立了散乱点云数据之间的拓扑信息，对点云数据进行三角剖分重构网格曲面模型。
After establishing the topology relationship of scattered points, the mesh surface model of point data is reconstructed by triangulation.
研究了在散乱数据的三角剖分后对所形成的空间三角形网格进行变形的具体操作算法。
The paper studies the main algorithm of morphing between spatial triangle meshes, which follows former articles of scatter data triangulation.
本文提出了一种适用于多连通的多边形区域的三角剖分和非连通的受限数据的三角剖分算法。
The paper presents a new triangulation method suitable for both multiple connected polygonal domains and unconnected constrained data.
思路是设计一个矩形辅助窗口，并利用“四边形对角线交换”技术来获得简单多边形的三角剖分。
The TSP problem is solved by designing an auxiliary square window and utilizing a "quadrilateral diagonal exchanging" technique.
文中还定义了平面单连通多边形区域的所谓分层三角剖分，并确定了此剖分下二次样条空间的维数。
Then, a new kind of so-called stratified triangulation of a simply connected planar polygonal region is introduced.
结合储层建模结点数据的特点，提出了一种对多边形区域内建模结点数据进行快速三角剖分的算法。
A fast algorithm is put forward that is used to triangulate stochastic reservoir modeling data in a polygonal domain.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
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.
然后，提出了以推进波前法与映射法相结合处理裁剪曲面的三角剖分方法，并给出了具体的实现算法。
Then, the paper put forward method used to Triangular segmentation of trimmed surface by combining the Advancing Front Technique with Mapping Technique, and afforded its special algorithm .
二元三方向剖分是方向最少的三角剖分，建立在其上的二元三向四次箱样条在CAGD等领域有着广泛的应用。
Bivariate 3-direction is a triangulation with the least directions. Box spline built on it is widely applied in CAGD.
三角剖分是有限元网格划分的重要工具之一。本文将这一方法应用于装配图的消隐之中，并介绍其原理及实现步骤。
Triangulation is an important way of finite element mesh generation. In this paper, this way is introduced into hiding assembly drawing, the relating theory and steps are also discussed.
该方法通过在遥感图像上选取局部极值点来构成平面散乱数据点集，并在此基础上进行三角剖分、优化和三角插值曲面构造。
It gets the plane scattered data points through selecting the local extremum points on the remote image, and then triangulates, constructs the triangular interpolating surface on it.
三维矿体表面建模技术主要包括勘探线剖面矿体边界线的圈定、相邻边界线之间三角剖分和单个边界线内部三角剖分等内容。
The 3d ore body surface modeling technique mainly contains contouring the mineral profiles within prospecting line, triangulating the neighbouring contours, triangulating inside single contours.
证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。
In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.
利用NURBS曲线的拟合技术实现了截面轮廓数据的精整，在此基础上，采用曲线间相容性处理实现了散乱数据的三角剖分算法。
The precision data of section contour is obtained by NURBS approximation. Based on which, the triangulation algorithm of scattered data is carried out through the disposal of NURBS compatibility.
该方法对人脸特征点集做三角剖分，在纹理图像和三维网格之间建立了一个准确的拓扑同构映射关系，从而得到高真实度的纹理映射。
Applying a D-triangulation on the facial feature points, a precise and topological isomorphic mapping is established between 3d mesh and texture. The texture mapping with high quality can be obtained.
顾及地形特征线的散点域(约束数据域)三角剖分是建立高精度数字地面模型的基础，在GIS、地学分析、计算几何、多分辨率DTM等领域中有着广泛的应用。
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.
概述了平面多边形三角形剖分的各种算法，提出了一种不考虑多边形的凸凹性、顶点顺时针或逆时针走向循环消除顶点的平面多边形三角剖分算法，并给出了实例。
We have proposed an arithmetic of this kind to eliminate the vertex in a circling way, ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon.
采用局部剖分的方法来保证边界的完整性，不需要添加新的节点到原始表面三角形中。
To ensure the existence of boundary sides and faces, local tetrahedralization method is adopted, needing add no node into the origin surface triangulations.
利用数学归纳法证明算法对任意多个离散点三角形网格剖分的正确性，并通过试验验证了算法的可行性。
The mathematical induction is used to prove the correctness of the algorithm towards the triangle mesh of random multi-points, and the experiment proves its feasibility.
利用数学归纳法证明算法对任意多个离散点三角形网格剖分的正确性，并通过试验验证了算法的可行性。
The mathematical induction is used to prove the correctness of the algorithm towards the triangle mesh of random multi-points, and the experiment proves its feasibility.
应用推荐