A region - growing algorithm was proposed to reconstruct triangular meshes unorganized point cloud.
提出一种对无规则点云进行三角网格重构的区域增长算法。
A new algorithm called the weighted least square discrete parameterization (WLSDP) is presented for the parameterization of triangular meshes over a convex planar region.
提出了一种新的曲面三角网格模型参数化算法——加权最小二乘离散参数化方法(WLSDP)。
By using boundary circle and restricted region, this paper gives a criterion for judging whether Fermat point is a triangular point.
本文利用限制圆和限制区域，给出了费尔马点为三角点的判断条件，同时得到了特殊的正三角形的三角点的分布情。
With regard to an arbitrary planar region, we decompose it into relatively uniform triangular mesh to produce triangles as the unit for texture synthesis.
对于任意平面区域需剖分成较均匀的三角网格，以剖分得到的三角形作为基本的合成单元来进行合成。
A new region-growing algorithm is presented for triangular mesh surface reconstruction from point-cloud data.
提出一种新的由点云数据生成三角网格曲面的区域增长算法。
According to conformal map and relative theory, the relation of path interval between triangular meshes and parametric region is built.
根据协调映射及相关理论，建立了原网格曲面和参数域曲面的路径间距及步长的对应关系。
According to conformal map and relative theory, the relation of path interval between triangular meshes and parametric region is built.
根据协调映射及相关理论，建立了原网格曲面和参数域曲面的路径间距及步长的对应关系。
应用推荐