Terrain prickliness: theoretical grounds for low complexity viewsheds.
作者： Hans Raj Tiwary , Frank Staals , Maarten Löffler , Rodrigo I. Silveira , Maria Saumell
DOI:
关键词: Cartography 、 Computer science 、 High complexity 、 Position (vector) 、 Terrain 、 Maxima and minima 、 Real word 、 Low complexity 、 Viewshed analysis 、 Polyhedral terrain
摘要: An important task when working with terrain models is computing viewsheds: the parts of visible from a given viewpoint. When modeled as polyhedral terrain, viewshed composed union all triangle that are The complexity can vary significantly, constant to quadratic in number vertices, depending on topography and viewpoint position. In this work we study new topographic attribute, \emph{prickliness}, measures local maxima possible perspectives. We show prickliness effectively captures potential 2.5D terrains have high viewsheds, present near-optimal algorithms compute 1.5D terrains. also report some experiments relating real word size their complexity.
arxiv.org参考文章(21)
Maria Danese, Gabriele Nolè, Beniamino Murgante, Identifying Viewshed: New Approaches to Visual Impact Assessment Geocomputation, Sustainability and Environmental Planning. pp. 73- 89 ,(2011) , 10.1007/978-3-642-19733-8_5
Christian Vogt, W. Randolph, MULTIPLE OBSERVER SITING ON TERRAIN WITH INTERVISIBILITY OR LO-RES DATA ,(2004)
Frank Kammer, Maarten Löffler, Paul Mutser, Frank Staals, Practical Approaches to Partially Guarding a Polyhedral Terrain geographic information science. ,vol. 8728, pp. 318- 332 ,(2014) , 10.1007/978-3-319-11593-1_21
J. H. Reif, S. Sen, An efficient output-sensitive hidden surface removal algorithm and its parallelization symposium on computational geometry. pp. 193- 200 ,(1988) , 10.1145/73393.73413
Anna Lubiw, András Rácz, A lower bound for the integer element distinctness problem Information & Computation. ,vol. 94, pp. 83- 92 ,(1991) , 10.1016/0890-5401(91)90034-Y
Uta Schirpke, Erich Tasser, Ulrike Tappeiner, Predicting scenic beauty of mountain regions Landscape and Urban Planning. ,vol. 111, pp. 1- 12 ,(2013) , 10.1016/J.LANDURBPLAN.2012.11.010
B. Joe, R. B. Simpson, Corrections to Lee's visibility polygon algorithm BIT. ,vol. 27, pp. 458- 473 ,(1987) , 10.1007/BF01937271
Michael McKenna, Worst-case optimal hidden-surface removal ACM Transactions on Graphics. ,vol. 6, pp. 19- 28 ,(1987) , 10.1145/27625.27627
Young-Hoon Kim, Sanjay Rana, Steve Wise, Exploring multiple viewshed analysis using terrain features and optimisation techniques Computers & Geosciences. ,vol. 30, pp. 1019- 1032 ,(2004) , 10.1016/J.CAGEO.2004.07.008
H Edelsbrunner, L J Guibas, Topologically sweeping an arrangement symposium on the theory of computing. ,vol. 38, pp. 389- 403 ,(1986) , 10.1145/12130.12171