DocumentCode :
2447448
Title :
Max/Min Path Visual Coverage Problems in Raster Terrain
Author :
Lu, Min ; Zhang, Jinfang ; Lv, Pin ; Fan, Zhihua
Author_Institution :
Chinese Acad. of Sci., Beijing
fYear :
2007
fDate :
15-18 Oct. 2007
Firstpage :
497
Lastpage :
500
Abstract :
Path visual coverage is the region which could be seen from the path in the terrain. This paper advances the concept of "average horizon " which represents the wide extent of the visual field of each path point to analyze and model the max and min path visual coverage problems, and resolves them utilizing simulated annealing algorithm based on the operation of viewshed amalgamation with pre-computed and stored viewshed information.
Keywords :
minimax techniques; path planning; simulated annealing; terrain mapping; max-min path visual coverage problems; path visual coverage; raster terrain; simulated annealing algorithm; Algorithm design and analysis; Analytical models; Cities and towns; Equations; Geographic Information Systems; Information analysis; Information systems; Laboratories; Path planning; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design and Computer Graphics, 2007 10th IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-1579-3
Electronic_ISBN :
978-1-4244-1579-3
Type :
conf
DOI :
10.1109/CADCG.2007.4407939
Filename :
4407939
Link To Document :
بازگشت