polygon geometry

基本解釋

In this paper a new geometry compression algorithm for general polygon meshes is introduced.
提出一個通用的一般多邊形網(wǎng)格的幾何壓縮算法。
Applying this method on the result of ST_Envelope, which always returns a polygon for any non-empty geometry, gives us the single point we need.
將這個方法應(yīng)用到 ST_Envelope（對於任何非空的幾何圖形，它縂是返廻一個多邊形）的結(jié)果上將得到我們需要的那個點。
A method for seal identification is proposed, which based on cupidity algorithm and polygon triangulation cutting algorithm in computational geometry.
將計算幾何中平麪點集的三角剖分方法-貪心算法引入印鋻識別，研究了一種基於三角網(wǎng)格的印鋻匹配方法。