DocumentCode
2714622
Title
Point burning dynamical trajectory algorithm in simple polygon
Author
Zhang, Yunhui ; Gao, Mangtun ; Wu, Jianjun ; Zhang, Yan
Author_Institution
Coll. of Mechatron. Eng., Northwestern Polytech. Univ., Xi´´an, China
fYear
2011
fDate
24-26 June 2011
Firstpage
1
Lastpage
5
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.
Keywords
C++ language; computational geometry; visual programming; IntoPoint; OutPoint; VC++ programming testing; point burning dynamical trajectory algorithm; polygon circle; Bridges; Fires; Heuristic algorithms; Ignition; Joining processes; Materials; Trajectory; burning trajectory; computational geometry; shortest path; visibility polygon;
fLanguage
English
Publisher
ieee
Conference_Titel
Geoinformatics, 2011 19th International Conference on
Conference_Location
Shanghai
ISSN
2161-024X
Print_ISBN
978-1-61284-849-5
Type
conf
DOI
10.1109/GeoInformatics.2011.5981187
Filename
5981187
Link To Document