狄洛尼三角网(TIN).pptVIP

Bowyer-Watson Algorithm： Description of the algorithm Step 1 Define a bounding box that contains all the points. This step is needed to initialise the algorithm by defining an initial triangulation and associated topology. Step 2 Introduce a new point anywhere within the bounding box which, by construction, contains all the points. Step 3 Find the first triangle that fails the Delaunay test (Definition. 1 section 2.5.2 , Definition 3 section 2.5.4). * * 三角网（Triangulations） （TIN, triangulated irregular network） 通过从不规则分布的数据点生成的连续三角面来逼近地形表面 建立DEM的重要手段 优点：在某一分辨率下能用更少的空间和时间更精确的表示复杂的面，特别是当