{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:05:19Z","timestamp":1648987519292},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T00:00:00Z","timestamp":1366329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10707-013-0178-y","type":"journal-article","created":{"date-parts":[[2013,4,18]],"date-time":"2013-04-18T03:39:05Z","timestamp":1366256345000},"page":"193-228","source":"Crossref","is-referenced-by-count":4,"title":["The largest empty rectangle containing only a query object in Spatial Databases"],"prefix":"10.1007","volume":"18","author":[{"given":"Gilberto","family":"Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Param\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nieves","family":"Brisaboa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,19]]},"reference":[{"key":"178_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal A, Suri S (1987) Fast algorithms for computing the largest empty rectangle. In: Proceedings of SCG \u201987. ACM, pp 278\u2013290","DOI":"10.1145\/41958.41988"},{"key":"178_CR2","unstructured":"Augustine J, Das S, Maheshwari A, Nandy SC, Roy S, Sarvattomananda S (2010) Recognizing the largest empty circle and axis-parallel rectangle in a desired location. CoRR abs\/1004.0558"},{"key":"178_CR3","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. CoRR abs\/1004.0558v2"},{"issue":"2","key":"178_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":"3","key":"178_CR5","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"},{"key":"178_CR6","unstructured":"Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The R*-tree: An efficient and robust access method for points and rectangles, In: Garcia-Molina H, Jagadish HV (eds) Proceedings of SIGMOD \u201909. ACM Press, pp 322\u2013331"},{"key":"178_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kriegel H.-P (2001) Determining the convex hull in large multidimensional databases. In: Proceedings of DaWaK \u201901. Springer, pp 294\u2013306","DOI":"10.1007\/3-540-44801-2_29"},{"key":"178_CR8","unstructured":"B\u00f6rzs\u00f6nyi S, Kossmann D, Stocker K (2001) The skyline operator. In: Proccedings of ICDE \u201901. pp 421\u2013430"},{"key":"178_CR9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle B, Drysdalet RL, Lee DT (1986) Computing the largest empty rectangle. SIAM J Comput 15:300\u2013315","journal-title":"SIAM J Comput"},{"key":"178_CR10","unstructured":"Chew LP, Drysdale RLS (1986) Finding largest empty circles with location constraints. Tech. Rep. PCS-TR86-130, Dartmouth College, Computer Science, Hanover, NH"},{"issue":"1","key":"178_CR11","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"},{"key":"178_CR12","unstructured":"De M, Nandy SC (2011) Inplace algorithm for priority search tree and its use in computing largest empty axis-parallel rectangle. CoRR abs\/1104.3076"},{"key":"178_CR13","unstructured":"Dellis E, Seeger B (2007) Efficient computation of reverse skyline queries. In: Proceedings of VLDB \u201907. ACM, pp 291\u2013302"},{"key":"178_CR14","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"},{"issue":"2","key":"178_CR15","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231","journal-title":"ACM Comput Surv"},{"key":"178_CR16","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez G, Param\u00e1 J (2012) Finding the largest empty rectangle containing only a query point in large multidimensional databases. In: Proceedings of SSDBM 2012. Springer","DOI":"10.1007\/978-3-642-31235-9_21"},{"key":"178_CR17","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proceedings of SIGMOD \u201984, ACM, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"178_CR18","unstructured":"Hjaltason GR, Samet H (1998) Incremental distance join algorithms for spatial databases. In: Proceedings of SIGMOD \u201998, ACM, pp 237\u2013248"},{"key":"178_CR19","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 SODA 2012, SIAM, pp\u00a0338\u2013355","DOI":"10.1137\/1.9781611973099.31"},{"key":"178_CR20","doi-asserted-by":"crossref","unstructured":"Kaplan H, Sharir M (2012) Finding the maximal empty disk containing a query point. In: Proceedings of SCG 2012, SoCG \u201912. ACM, New York, NY, USA, pp 287\u2013292","DOI":"10.1145\/2261250.2261292"},{"key":"178_CR21","volume-title":"R-Trees: Theory and Applications (Advanced information and knowledge processing)","author":"Y Manolopoulos","year":"2005","unstructured":"Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) R-Trees: Theory and Applications (Advanced information and knowledge processing). Springer-Verlag New York, Inc., Secaucus, NJ, USA"},{"key":"178_CR22","unstructured":"Minati D, Nandy S (2011) Space-efficient algorithms for empty space recognition among a point set in 2d and 3d. In: Proceedings of the 23rd annual Canadian conference on computational geometry, pp 347\u2013353"},{"key":"178_CR23","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 DT, Hsu W-L (1984) On the maximum empty rectangle problem. Discrete Appl Math 8:267\u2013277","journal-title":"Discrete Appl Math"},{"issue":"3","key":"178_CR24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0898-1221(98)00125-4","volume":"36","author":"S Nandy","year":"1998","unstructured":"Nandy S, Bhattacharya B (1998) Maximal empty cuboids among points and blocks. Comput Math Appl 36(3):11\u201320","journal-title":"Comput Math Appl"},{"key":"178_CR25","unstructured":"Oracle spatial user\u2019s guide and reference (2012) http:\/\/docs.oracle.com\/html\/A88805_01\/sdo_intr.htm"},{"key":"178_CR26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840377","volume":"5","author":"M Orlowski","year":"1990","unstructured":"Orlowski M (1990) A new algorithm for the largest empty rectangle problem. Algorithmica 5:65\u201373","journal-title":"Algorithmica"},{"issue":"1","key":"178_CR27","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Fu G, Seeger B (2005) Progressive skyline computation in database systems. ACM T Database Syst 30(1):41\u201382","journal-title":"ACM T Database Syst"},{"key":"178_CR28","unstructured":"Postgis 1.5.3 manual (2012) http:\/\/postgis.refractions.net\/documentation\/manual-1.5\/"},{"issue":"2","key":"178_CR29","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":"178_CR30","unstructured":"Shekhar S, Chawla S (2003) Spatial databases - a tour. Prentice Hall"},{"issue":"5","key":"178_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01008046","volume":"12","author":"GT Toussaint","year":"1983","unstructured":"Toussaint GT (1983) Computing largest empty circles with location constraints. In J Comput Inf Sci 12(5):347\u2013358","journal-title":"In J Comput Inf Sci"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-013-0178-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-013-0178-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-013-0178-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T15:43:56Z","timestamp":1562946236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-013-0178-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,19]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s10707-013-0178-y","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,19]]}}}