基于约束Delaunay三角网的道路密度算法

Road Density Algorithm Based on Constrained Delaunay Triangulated Irregular Network

本文针对道路密度求解过程中道路覆盖区域面积难以确定的问题，提出一种基于约束Delaunay三角网的道路覆盖区面积计算方法。采取化整为零的思想，先对道路网分布区域进行约束Delaunay三角网（D—TIN）剖分，并根据道路所关联三角形对覆盖区面积的贡献度，将三角形分为四类，给出每类三角形面积贡献度的计算方法，通过累加所有关联三角形贡献的面积，得到道路覆盖区的面积；然后计算道路的密度。实验结果表明，此算法简化了道路密度计算过程中覆盖区域面积的求解过程，算法可靠和高效。

Aiming at the problem that it is difficult to calculate the area of road covered region in road density analysis, this paper proposes an algorithm for calculating the area of road covered region based on the constrained Delaunay triangulation irregular network （ D - TIN ）. Taking the idea of breaking up the whole into parts, the triangulations are classified into four types according to the contribution of triangulations associated with road to the area of road covered region, and the method for calculating the area of each type triangulation is presented. Meanwhile the area of the road covered region is calculated by accumulating all the area of triangulations related to the road. Then the road network density is calculated. The experiment results show that the algorithm simplifies the road covered area calculation in road density analysis, also it is reliable and efficient.