您要查找的是不是：
- A region-growing algorithm was proposed to reconstruct triangular meshes from unorganized point cloud. 摘要提出一种对无规则点云进行三角网格重构的区域增长算法。
- Abstract A new algorithm was proposed to partition triangular meshes into quadrangular segmentation automatically. 摘要 提出了一种对三角网格模型进行自动四边区域划分的算法。
- Abstract A segmentation approach was proposed for automatic partition of triangular meshes into quadrangular regions. 摘要 提出了一种对三角网格模型进行自动四边区域划分算法。
- In this paper, The cell of Triangular Meshes, for example vertex, line, face, is stored using Octree. 本文提出使用八叉树来存储三角网格中的点、线、面等图元。
- Parameterization of triangular meshes is an essential problem of Digital Geometry Processing,especially for texture mapping,remeshing and morphing. 三维网格的参数化是数字几何处理中一个基本问题,在纹理映射、重新网格化和几何变形等许多图形处理中都有着非常重要的应用。
- Then,a loop edge list and boundary searching boxes are used to triangulate these points.This method can generate triangular meshes with ease and speed. 该方法算法简单，生成三角形的速度快，且生成的三角形网格适用于有限元分析和车身曲面的反求问题。
- It firstly triangulates the feature points into triangular meshes, and then calculats the full correspondence of pixels by affine coordinates of the meshes. 先从输入的特征点集生成三角特征网格 ,然后根据过渡图像和原始图像的三角网格仿射关系求解所有象素点的对应关系。
- It presents an active method of segmenting teeth from triangular mesh model accurately, uses discrete curvature analysis on triangle meshes to get approximation curvature values. 首先，计算三角网格顶点的曲率，根据顶点曲率值筛选出特征区域；
- Triangular mesh, Backface culling, Normal, Topological mapping, Surfaces trimming, Mesh simplification. 01三角网格,背向面去除,法向量,拓扑映射,曲面切割,网格简化
- An algorithm of triangular mesh simplification with vertex culling is proposed.The method is based on bounded error. 提出了以限定误差界为准则，运用顶点去除法简化三角网格的算法。
- In order to solve the uncontinuity of element numbering after the gradual subdivision of the triangular meshes, the correlation coefficient are introduced in this paper. 通过引入相关系数，解决了任意区域三角单元网格的逐次剖分过程中，单元细分后单元编号不连续的情况。
- In this process, a new coding method makes the genetic algorithm suitable for specificity of triangular mesh. 在此过程中以一种新的编码方式使遗传算法能够适应网格优化的特殊性；
- With regard to an arbitrary planar region, we decompose it into relatively uniform triangular mesh to produce triangles as the unit for texture synthesis. 对于任意平面区域需剖分成较均匀的三角网格，以剖分得到的三角形作为基本的合成单元来进行合成。
- On the basis of that, this paper ameliorates to form an improved method, namely, ameliorated advancing front approach (AAFA) as the algorithm of triangular mesh generation. 选择一种方法即边界推进算法，在此基础上提出了一种改进的边界推进算法，作为本论文生成三角形网格的算法。
- Spherical QTM (Quaternary Triangular Mesh) is efficient to deal with the global data because of its advantages of multi-resolution and hierarchy. 球面四元三角网具有多分辨率和层次组织的特性,已成为目前研究球面问题的有效方法之一,本文主要讨论任意球面三角格网p的三拓扑数计算。
- After vertex culling, triangular mesh reconstruction is conducted at the generated polygon to fill up hollows formed in the above steps. 对顶点去除后，还需对因此形成的多边形区域进行网格重建，填补空洞。
- Determining spatial relation between two spherical objects is approached in this paper by recursive refine based on QTM (Quaternary Triangular Mesh) hierarchical partition. 主要讨论了在基于四元三角网 ( quaternary Triangular Mesh,简称 QTM)球面层次格网剖分的基础上 ,通过单元递归细化来确定 2个球面实体的空间关系。
- A technique of nonstructured triangular mesh generation which is easy to be incor-porated in the technique of self adaptive mesh refinement is developed. 发展了一种易于和自适应网格加密技术相结合的非结构三角形网格生成技术。
- The 3D triangular mesh data provide important data structure for representing three-dimensional models.The mesh data consist of topologic data and geometric data. 完整的三维影像资料，包含几何资料及拓朴资料，整合这两部份之资讯才可以构成一个三维网格曲面。
- A preprocessing procedure, which is for detecting creases and corners through two adjacent triangles’ dihedral angles and simplifying triangular mesh, is described. 在三角形网格预处理部分，利用两相邻三角形的法向夹角来检测曲面上的棱和角点，同时利用面积标准来简化三角形网格。
