一种凸多边形的爆破网络等时线算法研究

Study on a Triangle-inserted Algorithm of Isochrones of Blasting Network Based on Convex Polygon

从爆破网络等时线定义及等时线在爆破工程中的应用出发,提出了一种基于凸多边形的爆破等时线三角插入算法。首先由外向内分层找出所有由炮孔组成的凸多边形,然后将内层的凸多边形运用三角形插入算法逐次插入到外层凸多边形,从而找出炮孔的等时线,最后采用贪心算法修正少数等时线交叉点。结果表明,此算法生成速度快,解决了爆破网络等时线出现交叉点的情况,具有实际的工程应用价值。

The blasting network isochrones are clearly defined and introduced into the blasting engineering. A new triangle - inserted algorithm based Convex Polygon is proposed. Firstly, the algorithm finds all convex polygons based on layered algorithm. Secondly, inner convex polygons are inserted to outer convex polygon to get the blasting isochrones. And finally Greedy Algorithm is applied to modify a few net crosses of the isochrones. The results show that this algorithm can generate the blasting isochrones fast and solve the net crosses＇ problem. The isoehrones algo- rithm is good for blasting network design in the blasting engineering.