{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T20:52:14Z","timestamp":1680814334912},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:00:00Z","timestamp":1551139200000},"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":[[2019,10]]},"DOI":"10.1007\/s10707-019-00343-4","type":"journal-article","created":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T17:58:35Z","timestamp":1551203915000},"page":"621-661","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Top-k trajectories with the best view"],"prefix":"10.1007","volume":"23","author":[{"given":"Nafis Irtiza","family":"Tripto","sequence":"first","affiliation":[]},{"given":"Mahjabin","family":"Nahar","sequence":"additional","affiliation":[]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[]},{"given":"Farhana Murtaza","family":"Choudhury","sequence":"additional","affiliation":[]},{"given":"J. Shane","family":"Culpepper","sequence":"additional","affiliation":[]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,26]]},"reference":[{"key":"343_CR1","doi-asserted-by":"crossref","unstructured":"Asano T, Asano T, Guibas L, Hershberger J, Imai H (1985) Visibility-polygon search and euclidean shortest paths. In: Proceedings of the 26th annual symposium on foundations of computer science, SFCS. IEEE Computer Society, Washington, pp 155\u2013164","DOI":"10.1109\/SFCS.1985.65"},{"issue":"1","key":"343_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T Asano","year":"1986","unstructured":"Asano T, Asano T, Guibas L, Hershberger J, Imai H (1986) Visibility of disjoint polygons. Algorithmica 1(1):49\u201363","journal-title":"Algorithmica"},{"key":"343_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Moshe B, Hall-Holt O, Katz MJ, Mitchell JSB (2004) Computing the visibility graph of points within a polygon. In: Proceedings of the twentieth annual symposium on computational geometry, SCG \u201904. ACM, New York, pp 27\u201335","DOI":"10.1145\/997817.997825"},{"key":"343_CR4","doi-asserted-by":"crossref","unstructured":"Bittner J (2002) Efficient construction of visibility maps using approximate occlusion sweep. In: Proceedings of the 18th spring conference on computer graphics, SCCG \u201902. ACM, New York, pp 167\u2013175","DOI":"10.1145\/584458.584486"},{"key":"343_CR5","doi-asserted-by":"crossref","unstructured":"Chen L, O\u0307zsu MT, Oria V (2005) Robust and fast similarity search for moving object trajectories. In: Proceedings of the ACM SIGMOD international conference on management of data. Baltimore, Maryland, USA, June 14-16, pp 491\u2013502","DOI":"10.1145\/1066157.1066213"},{"key":"343_CR6","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X (2011) Discovering popular routes from trajectories. In: Proceedings of the 27th international conference on data engineering, ICDE 2011, April 11-16. Hannover, Germany, pp 900\u2013911","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"343_CR7","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X, Zheng Y, Xie X (2010) Searching trajectories by locations: an efficiency study. In: Proceedings of ACM SIGMOD international conference on management of data, SIGMOD \u201910. ACM, New York, pp 255\u2013266","DOI":"10.1145\/1807167.1807197"},{"key":"343_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.is.2013.12.002","volume":"42","author":"FM Choudhury","year":"2014","unstructured":"Choudhury FM, Ali ME, Masud S, Nath S, Rabban IE (2014) Scalable visibility color map construction in spatial databases. Inf Syst 42:89\u2013106","journal-title":"Inf Syst"},{"issue":"7","key":"343_CR9","doi-asserted-by":"publisher","first-page":"787","DOI":"10.14778\/3192965.3192970","volume":"11","author":"X Ding","year":"2018","unstructured":"Ding X, Chen L, Gao Y, Jensen CS, Bao H (2018) Ultraman: a unified platform for big trajectory data management and analytics. Proceedings of the VLDB Endowment 11(7):787\u2013799","journal-title":"Proceedings of the VLDB Endowment"},{"key":"343_CR10","doi-asserted-by":"crossref","unstructured":"Erikson C, Manocha D, Baxter WV III (2001) Hlods for faster display of large static and dynamic environments. In: Proceedings of symposium on interactive 3D graphics. ACM, pp 111\u2013120","DOI":"10.1145\/364338.364376"},{"key":"343_CR11","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B (2009) Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD Conference. ACM, pp 577\u2013590","DOI":"10.1145\/1559845.1559906"},{"issue":"11","key":"343_CR12","doi-asserted-by":"publisher","first-page":"2176","DOI":"10.1016\/j.ins.2010.02.010","volume":"180","author":"Y Gao","year":"2010","unstructured":"Gao Y, Zheng B, Chen G, Li Q, Chen C, Chen G (2010) Efficient mutual nearest neighbor query processing for moving object trajectories. Inform Sci 180(11):2176\u20132195","journal-title":"Inform Sci"},{"issue":"3","key":"343_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00778-010-0200-z","volume":"20","author":"Y Gao","year":"2011","unstructured":"Gao Y, Zheng B, Chen G, Li Q, Guo X (2011) Continuous visible nearest neighbor query processing in spatial databases. VLDB J 20(3):371\u2013396","journal-title":"VLDB J"},{"key":"343_CR14","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B, Lee WC, Chen G (2009) Continuous visible nearest neighbor queries. In: Proceedings of the 12th international conference on extending database technology: advances in database technology, EDBT \u201909. ACM, New York, pp 144\u2013155","DOI":"10.1145\/1516360.1516378"},{"key":"343_CR15","first-page":"1806","volume":"25","author":"Y Gu","year":"2014","unstructured":"Gu Y, Yu X, Yu G (2014) . Method for continuous reverse k-nearest neighbor queries in obstructed spatial databases 25:1806\u20131816","journal-title":"Method for continuous reverse k-nearest neighbor queries in obstructed spatial databases"},{"key":"343_CR16","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching, vol 14. ACM","DOI":"10.1145\/971697.602266"},{"key":"343_CR17","unstructured":"Haider CMR, Arman A, Ali ME, Choudhury FM (2016) Continuous maximum visibility query for a moving target. In: Australasian database conference. Springer, pp 82\u201394"},{"issue":"1","key":"343_CR18","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539791221505","volume":"24","author":"PJ Heffernan","year":"1995","unstructured":"Heffernan PJ, Mitchell JSB (1995) An optimal algorithm for computing visibility in the plane. SIAM J Comput 24(1):184\u2013201","journal-title":"SIAM J Comput"},{"issue":"2","key":"343_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/B:DAPD.0000013068.25976.88","volume":"15","author":"DV Kalashnikov","year":"2004","unstructured":"Kalashnikov DV, Prabhakar S, Hambrusch SE (2004) Main memory evaluation of monitoring queries over moving objects. Distrib Parallel Datab 15(2):117\u2013135","journal-title":"Distrib Parallel Datab"},{"issue":"2","key":"343_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/PL00009193","volume":"20","author":"DS Kim","year":"1998","unstructured":"Kim DS, Yoo KH, Chwa KY, Shin SY (1998) Efficient algorithms for computing a complete visibility region in three-dimensional space. Algorithmica 20 (2):201\u2013225","journal-title":"Algorithmica"},{"key":"343_CR21","doi-asserted-by":"crossref","unstructured":"Lee KC, Lee WC, Zheng B (2009) Fast object search on road networks. In: Proceedings of the 12th international conference on extending database technology: advances in database technology. ACM, pp 1018\u20131029","DOI":"10.1145\/1516360.1516476"},{"key":"343_CR22","unstructured":"Levandoski JJ, Khalefa ME, Mokbel MF (2011) The caredb context and preference-aware database system. In: 5th International workshop on personalized access, profile management, and context awareness in databases, PersDB-in conjunction with very large data bases, VLDB"},{"key":"343_CR23","doi-asserted-by":"crossref","unstructured":"Levandoski JJ, Mokbel MF, Khalefa ME (2010) Flexpref: a framework for extensible preference evaluation in database systems. In: IEEE 26th International conference on data engineering (ICDE). IEEE, pp 828\u2013839","DOI":"10.1109\/ICDE.2010.5447881"},{"key":"343_CR24","doi-asserted-by":"crossref","unstructured":"Masud S, Choudhury FM, Ali ME, Nutanong S (2013) Maximum visibility queries in spatial databases. In: 29th International conference on data engineering (ICDE). IEEE, pp 637\u2013648","DOI":"10.1109\/ICDE.2013.6544862"},{"key":"343_CR25","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Lin Y, Yiu ML (2010) Preference queries in large multi-cost transportation networks. In: IEEE 26th International conference on data engineering (ICDE). IEEE, pp 533\u2013544","DOI":"10.1109\/ICDE.2010.5447851"},{"key":"343_CR26","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Papadias D, Hadjieleftheriou M (2005) Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: Proceedings of ACM SIGMOD international conference on management of data. ACM, pp 634\u2013645","DOI":"10.1145\/1066157.1066230"},{"key":"343_CR27","first-page":"876","volume-title":"Visible nearest neighbor queries","author":"S Nutanong","year":"2007","unstructured":"Nutanong S, Tanin E, Zhang R (2007) Visible nearest neighbor queries. Springer, Berlin, pp 876\u2013883"},{"issue":"5","key":"343_CR28","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TKDE.2009.158","volume":"22","author":"S Nutanong","year":"2010","unstructured":"Nutanong S, Tanin E, Zhang R (2010) Incremental evaluation of visible nearest neighbor queries. IEEE Trans Knowl Data Eng 22(5):665\u2013681","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"343_CR29","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/B978-012722442-8\/50076-8","volume-title":"Proceedings 2003 VLDB Conference","author":"Dimitris Papadias","year":"2003","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the 29th international conference on very large data bases, vol 29. VLDB Endowment, pp 802\u2013813"},{"key":"343_CR30","doi-asserted-by":"crossref","unstructured":"Rabban IE, Abdullah K, Ali ME, Cheema MA (2015) Visibility color map for a fixed or moving target in spatial databases. In: International symposium on spatial and temporal databases. Springer, pp 197\u2013215","DOI":"10.1007\/978-3-319-22363-6_11"},{"key":"343_CR31","doi-asserted-by":"crossref","unstructured":"Rocha-Junior JB, N\u00f8rv\u00e5g K (2012) Top-k spatial keyword queries on road networks. In: Proceedings of the 15th international conference on extending database technology. ACM, pp 168\u2013179","DOI":"10.1145\/2247596.2247617"},{"key":"343_CR32","doi-asserted-by":"crossref","unstructured":"Shafique S, Ali ME (2016) Recommending most popular travel path within a region of interest from historical trajectory data. In: Proceedings of the 5th ACM SIGSPATIAL international workshop on mobile geographic information systems. ACM, pp 2\u201311","DOI":"10.1145\/3004725.3004728"},{"key":"343_CR33","doi-asserted-by":"crossref","unstructured":"Shang S, Ding R, Yuan B, Xie K, Zheng K, Kalnis P (2012) User oriented trajectory search for trip recommendation. In: Proceedings of the 15th international conference on extending database technology, EDBT. ACM, New York, pp 156\u2013167","DOI":"10.1145\/2247596.2247616"},{"issue":"3","key":"343_CR34","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2014","unstructured":"Shang S, Ding R, Zheng K, Jensen CS, Kalnis P, Zhou X (2014) Personalized trajectory matching in spatial networks. VLDB J 23(3):449\u2013468","journal-title":"VLDB J"},{"key":"343_CR35","doi-asserted-by":"crossref","unstructured":"Shou L, Huang Z, Tan KL (2003) Hdov-tree: the structure, the storage, the speed. In: Proceedings on 19th international conference on data engineering. IEEE, pp 557\u2013568","DOI":"10.1109\/ICDE.2003.1260821"},{"key":"343_CR36","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: International symposium on spatial and temporal databases. Springer, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"343_CR37","first-page":"57","volume-title":"Computing the approximate visibility map, with applications to form factors and discontinuity meshing","author":"AJ Stewart","year":"1998","unstructured":"Stewart AJ, Karkanis T (1998) Computing the approximate visibility map, with applications to form factors and discontinuity meshing. Springer, Vienna, pp 57\u201368"},{"key":"343_CR38","doi-asserted-by":"crossref","unstructured":"Suri S, O\u2019Rourke J (1986) Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the second annual symposium on computational geometry, SCG \u201986. ACM, New York, pp 14\u201323","DOI":"10.1145\/10515.10517"},{"key":"343_CR39","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D (2002) Time-parameterized queries in spatio-temporal databases. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data. ACM, pp 334\u2013345","DOI":"10.1145\/564691.564730"},{"key":"343_CR40","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: VLDB\u201902: Proceedings of the 28th international conference on very large databases. Elsevier, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"343_CR41","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/B978-155860869-6\/50033-0","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Yufei Tao","year":"2002","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of the 28th international conference on very large data bases, VLDB \u201902. VLDB Endowment, pp 287\u2013298"},{"issue":"1","key":"343_CR42","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.jcp.2004.02.015","volume":"199","author":"YHR Tsai","year":"2004","unstructured":"Tsai YHR, Cheng LT, Osher S, Burchard P, Sapiro G (2004) Visibility and its dynamics in a pde based implicit framework. J Comput Phys 199(1):260\u2013290","journal-title":"J Comput Phys"},{"key":"343_CR43","doi-asserted-by":"crossref","unstructured":"Wang S, Bao Z, Culpepper JS, Sellis T, Cong G (2017) Reverse k nearest neighbor search over trajectories. IEEE Transactions on Knowledge and Data Engineering","DOI":"10.1109\/ICDE.2018.00250"},{"key":"343_CR44","first-page":"203","volume-title":"A fast filter for obstructed nearest neighbor queries","author":"C Xia","year":"2004","unstructured":"Xia C, Hsu D, Tung AKH (2004) A fast filter for obstructed nearest neighbor queries. Springer, Berlin, pp 203\u2013215"},{"key":"343_CR45","unstructured":"Yu X, Pu KQ, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: Proceedings on 21st international conference on data engineering, iCDE. IEEE, pp 631\u2013642"},{"key":"343_CR46","doi-asserted-by":"crossref","unstructured":"Zarei A, Ghodsi M (2005) Efficient computation of query point visibility in polygons with holes. In: Proceedings of the twenty-first annual symposium on computational geometry, SCG \u201905. ACM, New York, pp 314\u2013320","DOI":"10.1145\/1064092.1064140"},{"key":"343_CR47","doi-asserted-by":"crossref","unstructured":"Zhang C, Shou L, Chen K, Chen G (2012) See-to-retrieve: efficient processing of spatio-visual keyword queries. In: SIGIR, pp 681\u2013690","DOI":"10.1145\/2348283.2348375"},{"issue":"9","key":"343_CR48","doi-asserted-by":"publisher","first-page":"934","DOI":"10.14778\/3213880.3213885","volume":"11","author":"D Zhang","year":"2018","unstructured":"Zhang D, Ding M, Yang D, Liu Y, Fan J, Shen HT (2018) Trajectory simplification: an experimental study and quality analysis. Proc VLDB Endowment 11(9):934\u2013946","journal-title":"Proc VLDB Endowment"},{"key":"343_CR49","first-page":"366","volume-title":"Spatial queries in the presence of obstacles","author":"J Zhang","year":"2004","unstructured":"Zhang J, Papadias D, Mouratidis K, Zhu M (2004) Spatial queries in the presence of obstacles. Springer, Berlin, pp 366\u2013384"},{"key":"343_CR50","doi-asserted-by":"crossref","unstructured":"Zheng K, Shang S, Yuan NJ, Yang Y (2013) Towards efficient search for activity trajectories. In: ICDE. IEEE Computer Society, pp 230\u2013241","DOI":"10.1109\/ICDE.2013.6544828"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-019-00343-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-019-00343-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-019-00343-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:08:00Z","timestamp":1582675680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-019-00343-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,26]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["343"],"URL":"https:\/\/doi.org\/10.1007\/s10707-019-00343-4","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,26]]},"assertion":[{"value":"18 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}