{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:20Z","timestamp":1740109280922,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T00:00:00Z","timestamp":1498694400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Conseller\u00eda de Cultura Xunta de Galicia","award":["ED43G\/01"],"award-info":[{"award-number":["ED43G\/01"]}]},{"name":"Universidade del B\u00edo-B\u00edo","award":["DIUBB 140515 3\/R"],"award-info":[{"award-number":["DIUBB 140515 3\/R"]}]},{"DOI":"10.13039\/501100008785","name":"Universidad del B\u00edo-B\u00edo","doi-asserted-by":"crossref","award":["DIUBB 142719 3\/R"],"award-info":[{"award-number":["DIUBB 142719 3\/R"]}],"id":[{"id":"10.13039\/501100008785","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2013-46238-C4-3-R","TIN2026-78011-C4-1-R"],"award-info":[{"award-number":["TIN2013-46238-C4-3-R","TIN2026-78011-C4-1-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001872","name":"Centre for Industrial Technological Development","doi-asserted-by":"publisher","award":["IDI-20141259","ITC-20151305"],"award-info":[{"award-number":["IDI-20141259","ITC-20151305"]}],"id":[{"id":"10.13039\/501100001872","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001872","name":"Centre for Industrial Technological Development","doi-asserted-by":"publisher","award":["ITC-20151247"],"award-info":[{"award-number":["ITC-20151247"]}],"id":[{"id":"10.13039\/501100001872","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10115-017-1075-8","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T06:48:26Z","timestamp":1498718906000},"page":"141-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The largest empty circle with location constraints in spatial databases"],"prefix":"10.1007","volume":"55","author":[{"given":"Gilberto","family":"Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan R.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Param\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel R.","family":"Penabad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"1075_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal A, Suri S (1987) Fast algorithms for computing the largest empty rectangle. In: Proceedings of third annual symposium on computational geometry SCG, pp 278\u2013290","DOI":"10.1145\/41958.41988"},{"key":"1075_CR2","unstructured":"Augustine J, Das S, Maheshwari A, Nandy SC, Roy S, Sarvattomananda S (2010) Querying for the largest empty geometric object in a desired location. In: CoRR \n                        arXiv:abs\/1004.0558v2"},{"issue":"3","key":"1075_CR3","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.comgeo.2012.09.009","volume":"46","author":"J Augustine","year":"2013","unstructured":"Augustine J, Das S, Maheshwari A, Nandy SC, Roy S, Sarvattomananda S (2013) Localized geometric query problems. Comput Geom 46(3):340\u2013357","journal-title":"Comput Geom"},{"issue":"2","key":"1075_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jda.2009.10.002","volume":"8","author":"J Augustine","year":"2010","unstructured":"Augustine J, Putnam B, Roy S (2010) Largest empty circle centered on a query line. J Discrete Algorithms 8(2):143\u2013153","journal-title":"J Discrete Algorithms"},{"issue":"2","key":"1075_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jda.2009.10.002","volume":"8","author":"J Augustine","year":"2010","unstructured":"Augustine J, Putnam B, Roy S (2010) Largest empty circle centered on a query line. J Discrete Algorithms 8(2):143\u2013153","journal-title":"J Discrete Algorithms"},{"key":"1075_CR6","unstructured":"Azri S, Ujang U, Anton F, Mioc D, Rahman AA (2013) Review of spatial indexing techniques for large urban data management. In: Proceedings of international symposium & exhibition on geoinformation ISG"},{"issue":"3","key":"1075_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer R, McCreight EM (1972) Organization and maintenance of large ordered indexes. Acta Inform 1(3):173\u2013189","journal-title":"Acta Inform"},{"key":"1075_CR8","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD conference on management of data, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"1075_CR9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"1075_CR10","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kriegel HP (2001) Determining the convex hull in large multidimensional databases. In: Proceedings of the third international conference on data warehousing and knowledge discovery DaWaK, pp 294\u2013306","DOI":"10.1007\/3-540-44801-2_29"},{"key":"1075_CR11","doi-asserted-by":"crossref","unstructured":"Bose P, Wang Q (2002) Facility location constrained to a polygonal domain. In: Proceedings of the latin American symposium on theoretical informatics LATIN, pp 153\u2013164. Springer","DOI":"10.1007\/3-540-45995-2_18"},{"key":"1075_CR12","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0196-6774(02)00285-7","volume":"46","author":"J Chaudhuri","year":"2003","unstructured":"Chaudhuri J, Nandy SC, Das S (2003) Largest empty rectangle among a point set. J Algorithms 46:54\u201378","journal-title":"J Algorithms"},{"issue":"6","key":"1075_CR13","first-page":"969","volume":"8","author":"L Cheng","year":"2011","unstructured":"Cheng L, Wu C, Zhang Y, Wang Y (2011) An energy-balance repair scheme in wireless sensor networks. J Inf Comput Sci 8(6):969\u2013976","journal-title":"J Inf Comput Sci"},{"key":"1075_CR14","volume-title":"Advances in wireless ad hoc and sensor networks","author":"MX Cheng","year":"2008","unstructured":"Cheng MX, Li D (2008) Advances in wireless ad hoc and sensor networks. Springer, New York"},{"key":"1075_CR15","unstructured":"Chew LP, Drysdale RLS (1986) Finding largest empty circles with location constraints. Technical Report PCS-TR86-130, Dartmouth College, Computer Science, Hanover, NH"},{"key":"1075_CR16","unstructured":"Corral A (2002) Algoritmos para el procesamiento de consultas espaciales utilizando r-trees. la consulta de los pares m\u00e1s cercanos y su aplicaci\u00f3n en bases de datos espaciales. Ph.D. thesis, Universidad de Almer\u00eda, Escuela Polit\u00e9cnica Superior, Espa\u00f1a"},{"issue":"1","key":"1075_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A Corral","year":"2004","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2004) Algorithms for processing k-closest-pair queries in spatial databases. Data Knowl Eng 49(1):67\u2013104","journal-title":"Data Knowl Eng"},{"issue":"4","key":"1075_CR18","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/2696081.2696096","volume":"45","author":"A Dumitrescu","year":"2014","unstructured":"Dumitrescu A, Jiang M (2014) Computational geometry column 60. SIGACT News 45(4):76\u201382","journal-title":"SIGACT News"},{"key":"1075_CR19","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0304-3975(02)00738-7","volume":"296","author":"J Edmonds","year":"2003","unstructured":"Edmonds J, Gryz J, Liang D, Miller RJ (2003) Mining for empty spaces in large data sets. Theor Comput Sci 296:435\u2013452","journal-title":"Theor Comput Sci"},{"key":"1075_CR20","unstructured":"Filipe L, Vieira M, Augusto M, Vieira M, Ruiz LB, Alfredo A, Loureiro F, Silva DC, Otviofernandes A, Carlos AA, mg\u00a0Brazil PBH (2004) Efficient incremental sensor network deployment algorithm. In: Proceedings of Brazilian symposium on computer networks SBRC"},{"issue":"1","key":"1075_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL (1974) Quad trees a data structure for retrieval on composite keys. Acta Inform 4(1):1\u20139","journal-title":"Acta Inform"},{"key":"1075_CR22","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","volume":"25","author":"I Gargantini","year":"1982","unstructured":"Gargantini I (1982) An effective way to represent quadtrees. Commun ACM 25:905\u2013910","journal-title":"Commun ACM"},{"key":"1075_CR23","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R Graham","year":"1972","unstructured":"Graham R (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Proc Lett 1:132\u2013133","journal-title":"Inf Proc Lett"},{"key":"1075_CR24","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez G, Param\u00e1 JR (2012) Finding the largest empty rectangle containing only a query point in large multidimensional databases. In: Proceedings of conference on scientific and statistical database management SSDBM, pp 316\u2013333","DOI":"10.1007\/978-3-642-31235-9_21"},{"issue":"2","key":"1075_CR25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10707-013-0178-y","volume":"18","author":"G Guti\u00e9rrez","year":"2014","unstructured":"Guti\u00e9rrez G, Param\u00e1 JR, Brisaboa N, Corral A (2014) The largest empty rectangle containing only a query object in spatial databases. GeoInformatica 18(2):193\u2013228","journal-title":"GeoInformatica"},{"issue":"4","key":"1075_CR26","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10707-012-0169-4","volume":"17","author":"G Gutierrez","year":"2013","unstructured":"Gutierrez G, S\u00e1ez P (2013) The k closest pairs in spatial databases - when only one set is indexed. GeoInformatica 17(4):543\u2013565","journal-title":"GeoInformatica"},{"key":"1075_CR27","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD conference on management of data, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"1075_CR28","doi-asserted-by":"crossref","unstructured":"Hjaltason GR, Samet H (1998) Incremental distance join algorithms for spatial databases. In: Proceedings of ACM SIGMOD conference on management of data, pp 237\u2013248","DOI":"10.1145\/276304.276326"},{"key":"1075_CR29","doi-asserted-by":"crossref","unstructured":"Kaminker T, Sharir M (2014) Finding the largest disk containing a query point in logarithmic time with linear storage. In: Proceedings of the thirtieth annual symposium on computational geometry SCG, pp 206:206\u2013206:213","DOI":"10.1145\/2582112.2582164"},{"key":"1075_CR30","doi-asserted-by":"crossref","unstructured":"Kaplan H, Mozes S, Nussbaum Y, Sharir M (2012) Submatrix maximum queries in monge matrices and monge partial matrices, and their applications. In: Proceedings of symposium on discrete algorithms SODA, pp 338\u2013355","DOI":"10.1137\/1.9781611973099.31"},{"key":"1075_CR31","doi-asserted-by":"crossref","unstructured":"Kaplan H, Sharir M (2012) Finding the maximal empty disk containing a query point. In: Proceedings of the twenty-eighth annual symposium on computational geometry, pp 287\u2013292","DOI":"10.1145\/2261250.2261292"},{"key":"1075_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-293-5","volume-title":"R-trees: theory and applications","author":"Y Manolopoulos","year":"2006","unstructured":"Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2006) R-trees: theory and applications. Springer, London"},{"key":"1075_CR33","unstructured":"Mellou K (2014) Efficient algorithms for calculating the maximum empty cube in areas with obstacles. Ph.D. thesis, National Technical University of Athens, Greece"},{"issue":"3","key":"1075_CR34","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","volume":"8","author":"A Naamad","year":"1984","unstructured":"Naamad A, Lee D, Hsu WL (1984) On the maximum empty rectangle problem. Discrete Appl Math 8(3):267\u2013277","journal-title":"Discrete Appl Math"},{"key":"1075_CR35","volume-title":"Art gallery theorems and algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke J (1987) Art gallery theorems and algorithms. Oxford University Press Inc, New York"},{"key":"1075_CR36","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804120","volume-title":"Computational geometry in C","author":"J O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke J (1998) Computational geometry in C. Cambridge University Press, Cambridge"},{"key":"1075_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F Preparata","year":"1985","unstructured":"Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, New York"},{"issue":"1","key":"1075_CR38","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"FP Preparata","year":"1977","unstructured":"Preparata FP, Hong SJ (1977) Convex hulls of finite sets of points in two and three dimensions. Commun ACM 20(1):87\u201393","journal-title":"Commun ACM"},{"key":"1075_CR39","doi-asserted-by":"crossref","unstructured":"Robinson JT (1981) The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 10\u201318","DOI":"10.1145\/582318.582321"},{"issue":"2","key":"1075_CR40","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. SIGMOD Rec 24(2):71\u201379","journal-title":"SIGMOD Rec"},{"key":"1075_CR41","volume-title":"Foundations of multidimensional and metric data structures","author":"H Samet","year":"2006","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures. MorganKaufmann, San Francisco"},{"key":"1075_CR42","unstructured":"Shamos MI (1978) Computational geometry. Ph.D. thesis, Dept. Computer Sciences, Yale University"},{"key":"1075_CR43","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey D (1975) Closest-point problems. In: Proceedings of 16th annual symposium on foundations of computer science FOCS, pp 151\u2013162. IEEE","DOI":"10.1109\/SFCS.1975.8"},{"key":"1075_CR44","unstructured":"Stratil H (2004) An efficient implementation of the greedy forwarding strategy. In: Proceedings of Informatik 2004, Informatik verbindet, Band 2, Beitrge der 34. Jahrestagung der Gesellschaft fr Informatik e.V., pp 365\u2013369"},{"issue":"5","key":"1075_CR45","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01008046","volume":"12","author":"G Toussaint","year":"1983","unstructured":"Toussaint G (1983) Computing largest empty circles with location constraints. Int J Comput Inf Sci 12(5):347\u2013358","journal-title":"Int J Comput Inf Sci"},{"issue":"2","key":"1075_CR46","doi-asserted-by":"crossref","first-page":"333","DOI":"10.2140\/pjm.1976.64.333","volume":"64","author":"FA Valentine","year":"1976","unstructured":"Valentine FA, Buchman E (1976) External visibility. Pacific J Math 64(2):333\u2013340","journal-title":"Pacific J Math"},{"issue":"14\u201315","key":"1075_CR47","first-page":"2744","volume":"30","author":"CH Wu","year":"2007","unstructured":"Wu CH, Lee KC, Chung YC (2007) A delaunay triangulation based method for wireless sensor network deployment. Comput Commun 30(14\u201315):2744\u20132752","journal-title":"Comput Commun"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1075-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1075-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1075-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,8]],"date-time":"2018-03-08T10:54:16Z","timestamp":1520506456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1075-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,29]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["1075"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1075-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,6,29]]}}}