The quality of approximation is as good as polygonal boundary reduction, and it can process the data online in a constant buffer.
算法具有多边形约简算法相同的优良的近似质量，并可在固定数据缓冲区空间内在线运算。
The paper presents a new triangulation method suitable for both multiple connected polygonal domains and unconnected constrained data.
本文提出了一种适用于多连通的多边形区域的三角剖分和非连通的受限数据的三角剖分算法。
A fast algorithm is put forward that is used to triangulate stochastic reservoir modeling data in a polygonal domain.
结合储层建模结点数据的特点，提出了一种对多边形区域内建模结点数据进行快速三角剖分的算法。
A fast algorithm is put forward that is used to triangulate stochastic reservoir modeling data in a polygonal domain.
结合储层建模结点数据的特点，提出了一种对多边形区域内建模结点数据进行快速三角剖分的算法。
应用推荐