Computing visibility on terrains in external memory
暂无分享,去创建一个
[1] Richard Cole,et al. Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..
[2] Lars Arge. External-Memory Algorithms with Applications in Geographic Information Systems , 1997 .
[3] Sergey Bereg,et al. Guarding a Terrain by Two Watchtowers , 2008, Algorithmica.
[4] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[5] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.
[6] Leila De Floriani,et al. Visibility Algorithms on Triangulated Digital Terrain Models , 1994, Int. J. Geogr. Inf. Sci..
[7] PETER F. FISHER,et al. Algorithm and Implementation Uncertainty in Viewshed Analysis , 1993, Int. J. Geogr. Inf. Sci..
[8] M. J. van Kreveld,et al. Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals , 1996 .
[9] Jeffrey Scott Vitter,et al. External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract) , 1995, ESA.
[10] W. Randolph Franklin. Higher isn ’ t Necessarily Better : Visibility Algorithms and Experiments , 1994 .
[11] Joseph S. B. Mitchell,et al. A constant-factor approximation algorithm for optimal terrain guarding , 2005, SODA '05.
[12] W. R. Franklin. Siting Observers on Terrain , 2002 .
[13] Jeffrey Scott Vitter,et al. I/O-Efficient Algorithms for Problems on Grid-Based Terrains , 2001, JEAL.
[14] D. E. Vengroff. Tpie user manual and reference , 1995 .
[15] Jyh-Jong Tsay,et al. External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.