triangulations

This paper presents a simple and effective method for morphing two given compatible planar triangulations with different convex boundaries.

对于具有不同凸边界的同构平面三角网格的变形，提出了一种简单、有效的方法。

More than half a century has elapsed since the performance of three kinds of triangulations all over Japan.

自从在全日本进行这三种三角测量以来，已过了半个多世纪。

This paper proposed a fast interpolation technique for two compatible triangulations.

提出了一种针对于同构三角网格图形的快速插值方法。

Classic algorithms such as ROAM and VDPM attempt to generate triangulations which optimally adapt to terrain given as a height map.

经典的算法如ROAM和VDPM试图生成一系列能理想地适合地形的三角形，地形通过高度图给出。

Causal dynamical triangulations looks pretty similar to loop quantum gravity at first glance.

乍看起来，CDT和圈量子引力论很像。

A Study of Two Adaptive Method on Unstructured Delaunay Triangulations

基于非结构三角网格的两种自适应技术研究

Constraint Delaunay triangulations, uses in to cut in half has exterior contour line or the internal contour line separate set of points

用于剖分具有外部轮廓线或内部轮廓线的离散点集

An Optimal Criterion Based-on the Estimation Curvature of a Convex Quadrilateral for Triangulations

基于凸四边形曲率的三角剖分优化准则

Equilibrium Small Circuit Double Covers of Near-Triangulations

近三角剖分图的均衡二重少圈覆盖

Triangulations based on a criterion of minimized curvature for scattered point-sets

基于一种曲率最小优化准则的散乱点三角剖分

Near-Triangulations of Small Circuit Double Cover with at Most n-2

至多n-2圈二重覆盖的近三角剖分图