Point burning dynamical trajectory algorithm in simple polygon

Abstract

A model of Polygon Circle is proposed to simulate the dynamic burning trajectories in a polygonal pasture. Several technologies are used to achieve this algorithm in this paper. They are: (1) The computing for the minimum and maximum distance of a viewpoint to a vector line. (2) Total 17 kinds of locations for the position relationships of a circle to vector lines. (3) The definition for IntoPoint and OutPoint, and the count of both points are also used to judge whether drawing an arc. (4) The visible division and the deep visible division for a polygon. (5) The shortest path and its expansion. This algorithm can achieve such things that drawing the burning trajectories at different times, computing the burning times in different positions, estimating the longest distance and the longest time of burning. This algorithm is stabile by VC++ programming testing.