{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:42:31Z","timestamp":1648550551358},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10707-014-0213-7","type":"journal-article","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T09:17:23Z","timestamp":1408007843000},"page":"435-461","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Querying visible points in large obstructed space"],"prefix":"10.1007","volume":"19","author":[{"given":"Jianqiu","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf Hartmut","family":"G\u00fcting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"key":"213_CR1","unstructured":"http:\/\/dna.fernuni-hagen.de\/secondo.html\/index.html."},{"key":"213_CR2","unstructured":"http:\/\/www.bbbike.de\/cgi-bin\/bbbike.cgi(2012.6.25)"},{"key":"213_CR3","unstructured":"http:\/\/www.census.gov\/geo\/www\/tiger\/tgrshp2010\/tgrshp2010.html(2012.6.25)."},{"key":"213_CR4","unstructured":"http:\/\/www.chorochronos.org\/?q=node\/59(2013.8)"},{"key":"213_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Moshe B, Hall-Holt OA, Katz MJ, Mitchell JSB (2004) Computing the visibility graph of points within a polygon. In: symposium on computational geometry, pp 27\u201335","DOI":"10.1145\/997817.997825"},{"key":"213_CR6","doi-asserted-by":"crossref","unstructured":"Chazelle B (1982) A theorem on polygon cutting with applications.In: IEEE symposium on foundations of computer science","DOI":"10.1109\/SFCS.1982.58"},{"key":"213_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational geometry:algorithms and applications","author":"M De Berg","year":"2000","unstructured":"De Berg M, Kreveld M, Overmars M, Schwarzkopf O (2000) Computational geometry:algorithms and applications, 2nd edn. Springer, Berlin","edition":"2"},{"key":"213_CR8","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B (2009) Continuous obstructed nearest neighbor queries in spatial databases.In: SIGMOD, pp 577\u2013590","DOI":"10.1145\/1559845.1559906"},{"issue":"9","key":"213_CR9","first-page":"1314","volume":"21","author":"Y Gao","year":"2009","unstructured":"Gao Y, Zheng B, Chen G, Lee WC, Lee KCK, Li Q (2009) Visible reverse k-nearest neighbor query processing in spatial databases. TKDE 21(9):1314\u20131327","journal-title":"TKDE"},{"key":"213_CR10","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B, Lee W, Chen G (2009) Continuous visible nearest neighbor queries. In: EDBT, pp 144\u2013155","DOI":"10.1145\/1516360.1516378"},{"key":"213_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility algorithms in the plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh S K (2007) Visibility algorithms in the plane. Cambridge University Press, United Kingdom"},{"issue":"5","key":"213_CR12","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh SK, Mount DM (1991) An output-sensitive algorithm for computing visibility graphs. SIAM J Comput 20(5):888\u2013910","journal-title":"SIAM J Comput"},{"key":"213_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas L, Hershberger J, Leven D, Sharir M, Tarjan RE (1987) Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2:209\u2013233","journal-title":"Algorithmica"},{"issue":"4","key":"213_CR14","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00453-001-0028-4","volume":"30","author":"M Held","year":"2001","unstructured":"Held M (2001) Fist:fast industrial-strength triangulation of polygons. Algorithmica 30(4):563\u2013596","journal-title":"Algorithmica"},{"key":"213_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J Hershberger","year":"1994","unstructured":"Hershberger J, Snoeyink J (1994) Computing minimum length paths of a given homotopy class. Comp Geom Theory and Appl 4:63\u201397","journal-title":"Comp Geom Theory and Appl"},{"issue":"6","key":"213_CR16","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J Hershberger","year":"1999","unstructured":"Hershberger J, Suri S (1999) An optimal algorithm for euclidean shortest paths in the plane. SIAM J Comput 28(6):2215\u20132256","journal-title":"SIAM J Comput"},{"key":"213_CR17","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S Kapoor","year":"1997","unstructured":"Kapoor S, Maheshwari SN, Mitchell JSB (1997) An efficient algorithm for euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput Geom 18:377\u2013383","journal-title":"Discrete Comput Geom"},{"key":"213_CR18","doi-asserted-by":"crossref","unstructured":"Kazemi L, Kashani FB, Shahabi C, Jain R (2010) Efficient approximate visibility query in large dynamic environments. In: DASFAA (1), pp 202\u2013217","DOI":"10.1007\/978-3-642-12026-8_17"},{"issue":"3","key":"213_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee DT, Preparata FP (1984) Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3):393\u2013410","journal-title":"Networks"},{"key":"213_CR20","doi-asserted-by":"crossref","unstructured":"Masud S, Choudhury F M, Ali M E, Nutanong S (2013) Maximum visibility queries in spatial databases. In: ICDE, pp 637\u2013648","DOI":"10.1109\/ICDE.2013.6544862"},{"key":"213_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JSB Mitchell","year":"1996","unstructured":"Mitchell JSB (1996) Shortest paths among obstacles in the plane. Internet Journal Comput Geom 6:309\u2013332","journal-title":"Internet Journal Comput Geom"},{"key":"213_CR22","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-12-543457-7.50059-0","volume-title":"Fast polygon triangulation based on Seidel\u2019s algorithm","author":"A Narkhede","year":"1995","unstructured":"Narkhede A, Manocha D (1995) Fast polygon triangulation based on Seidel\u2019s algorithm. Academic Press, Graphics Gems V"},{"key":"213_CR23","doi-asserted-by":"crossref","unstructured":"Nutanong S, Tanin E, Zhang R (2007) Visible nearest neighbor queries. In: DASFAA, pp 876\u2013883","DOI":"10.1007\/978-3-540-71703-4_73"},{"key":"213_CR24","doi-asserted-by":"crossref","unstructured":"Overmars M H, Welz E (1988) New methods for computing visibility graphs.In: Proceedings 4th annual ACM symposium on computational geometry, pp 164\u2013171","DOI":"10.1145\/73393.73410"},{"key":"213_CR25","doi-asserted-by":"crossref","unstructured":"Park SH, Lee JH, Kim DH (2007) Spatial clustering based on moving distance in the presence of obstacles. In: DASFAA, pp 1024\u20131027","DOI":"10.1007\/978-3-540-71703-4_96"},{"key":"213_CR26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0925-7721(95)00016-X","volume":"6","author":"M Pocchiola","year":"1995","unstructured":"Pocchiola M, Vegter G (1995) Minimal tangent visibility graph. Comput Geom Theor Appl 6:303\u2013314","journal-title":"Comput Geom Theor Appl"},{"issue":"1","key":"213_CR27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M Sharir","year":"1986","unstructured":"Sharir M, Schorr A (1986) On shortest paths in polyhedral spaces. SIAM J Comput 15(1):193\u2013215","journal-title":"SIAM J Comput"},{"issue":"5","key":"213_CR28","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1145\/185675.185795","volume":"41","author":"JA Storer","year":"1994","unstructured":"Storer JA, Reif JH (1994) Shortest paths in the plane with polygonal obstacles. J ACM 41(5):982\u20131012","journal-title":"J ACM"},{"key":"213_CR29","doi-asserted-by":"crossref","unstructured":"Asano T, Ghosh SK, Shermer TC (2000) Visibility in the plane.Handbook of computation geometry. Elsevier","DOI":"10.1016\/B978-044482537-7\/50020-6"},{"key":"213_CR30","doi-asserted-by":"crossref","unstructured":"Tung AKH, Hou J, Han J (2001) Spatial clustering in the presence of obstacles. In: ICDE, pp 359\u2013367","DOI":"10.1109\/ICDE.2001.914848"},{"key":"213_CR31","doi-asserted-by":"crossref","unstructured":"Xia C, Hsu D, Tung AKH (2004) A fast filter for obstructed nearest neighbor queries. In: BNCOD, pp 203\u2013215","DOI":"10.1007\/978-3-540-27811-5_19"},{"key":"213_CR32","unstructured":"Xu J, G\u00fcting RH (2012) MWGen:a mini world generator. In: MDM, pp 258\u2013267"},{"key":"213_CR33","doi-asserted-by":"crossref","unstructured":"Yang B, Lu H, Jensen CS (2009) Scalable continuous range monitoring of moving objects in symbolic indoor space. In: CIKM, pp 671\u2013680","DOI":"10.1145\/1645953.1646039"},{"key":"213_CR34","doi-asserted-by":"crossref","unstructured":"Yang B, Lu H, Jensen CS (2010) Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space. In: EDBT, pp 335\u2013346","DOI":"10.1145\/1739041.1739083"},{"key":"213_CR35","unstructured":"Za\u00efane OR, Lee CH (2002) Clustering spatial data in the presence of obstacles: a density-based approach. In: IDEAS, pp 214\u2013223"},{"key":"213_CR36","doi-asserted-by":"crossref","unstructured":"Zhang J, Papadias D, Mouratidis K, Zhu M (2004) Spatial queries in the presence of obstacles. In: EDBT","DOI":"10.1007\/978-3-540-24741-8_22"},{"issue":"10","key":"213_CR37","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1080\/13658810500286935","volume":"19","author":"J Zhang","year":"2005","unstructured":"Zhang J, Papadias D, Mouratidis K, Zhu M (2005) Query processing in spatial databases containing obstacles. Int J Geogr Inf Sci 19(10):1091\u20131111","journal-title":"Int J Geogr Inf Sci"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-014-0213-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-014-0213-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-014-0213-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T18:30:31Z","timestamp":1565721031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-014-0213-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s10707-014-0213-7","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,15]]}}}