Zobrazeno 1 - 1
of 1
pro vyhledávání: '"N. Sitchinavaz"'
Autor:
H. Casanovaz, M.T. de Berg, Constantinos Tsirogiannis, N. Sitchinavaz, C. Lambrechts, Peyman Afshani, Ben Karsin
Publikováno v:
ALENEX
Afshani, P, De Berg, M, Casanova, H, Karsin, B, Lambrechts, C, Sitchinava, N & Tsirogiannis, C 2017, An efficient algorithm for the 1D total visibility-index problem . in S Fekete & V Ramachandran (eds), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) . vol. PRAL17, Society for Industrial and Applied Mathematics, pp. 218-231, 19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017, Barcelona, Spain, 17/01/2017 . https://doi.org/10.1137/1.9781611974768.18
Afshani, P, De Berg, M, Casanova, H, Karsin, B, Lambrechts, C, Sitchinava, N & Tsirogiannis, C 2017, An efficient algorithm for the 1D total visibility-index problem . in S Fekete & V Ramachandran (eds), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) . vol. PRAL17, Society for Industrial and Applied Mathematics, pp. 218-231, 19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017, Barcelona, Spain, 17/01/2017 . https://doi.org/10.1137/1.9781611974768.18
Let T be a terrain, and let P be a set of points (locations) on its surface. An important problem in Geographic Information Science (GIS) is computing the visibility index of a point p on P, that is, the number of points in P that are visible from p.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaadcdef18bc7506f0b8f99320f60ee4
https://doi.org/10.1137/1.9781611974768.18
https://doi.org/10.1137/1.9781611974768.18
