본문 바로가기
  • Home

A generation of Optimal Path Passing through Shadow Volume in Terrain

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2007, 12(6), pp.131-138
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

IM,IN-SUN 1 KOO JA YOUNG 2

1오산대학
2단국대학교

Accredited

ABSTRACT

I intend to seek the shortest path which an aircraft safely flies to its destination through the shadow volume of three dimensional terrain which propagation does not extend. Herein, I propose a method in which a relatively wide shadow volume is divided with a polygon type of block polygon, a path up to the intermediate destination is sought in the divided block polygons according to the weight, and then, the shortest path up to the final destination is sought by repeating courses for seeking a destination again from the adjacent polygon based on the starting point of the intermediate destination within the divided polygon. The shortest path was searched by using the revised algorithms which apply to a critical angle from graph growth algorithms on the shadow volume which propagation on the actual three dimensional terrain does not extend to. The experiment shows that a method proposed in this paper creates effective flying curves.

Citation status

* References for papers published after 2022 are currently being built.