Delaunay triangulation

常見例句

This paper presents an algorithm to find homonymous line from images based on Delaunay triangulation(TIN).
提出了根據(jù)同名像點(diǎn)搆成三角網(wǎng)（TIN）來進(jìn)行同名直線的匹配。
A new triangulation algorithm based on Delaunay triangulation and the advantage of simplicity and rapidness of advancing front method is constructed.
基於波前推進(jìn)法提出了一種針對任意平麪區(qū)域生成三角形網(wǎng)格的全自動生成算法。
The delaunay triangulation of a 2D scattered data set with inner boundary constraints is one of the basic questions in finite element analysis, computer graphics and realistic graphics etc.
帶內(nèi)邊界約束條件點(diǎn)集的三角剖分是有限元分析、計(jì)算機(jī)圖形學(xué)及真實(shí)感圖形等許多領(lǐng)域常遇到的一個(gè)基本問題。