{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:13:50Z","timestamp":1648610030855},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T00:00:00Z","timestamp":1495843200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10115-017-1063-z","type":"journal-article","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T04:04:41Z","timestamp":1495857881000},"page":"287-314","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear separability in spatial databases"],"prefix":"10.1007","volume":"54","author":[{"given":"Claudio","family":"Torres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilberto","family":"Guti\u00e9rrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"issue":"2","key":"1063_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/1150334.1150338","volume":"2","author":"PK Agarwal","year":"2006","unstructured":"Agarwal PK, Aronov B, Koltun V (2006) Efficient algorithms for bichromatic separability. ACM Trans Algorithms 2(2):209\u2013227","journal-title":"ACM Trans Algorithms"},{"key":"1063_CR2","unstructured":"Bennett KP, Bredensteiner EJ (2000) Duality and geometry in SVM classifiers. In: Proceedings of the 17th international conference on machine learning, ICML\u201900. Morgan Kaufmann Publishers Inc., San Francisco, pp 57\u201364"},{"key":"1063_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kriegel H-P (2001) Determining the convex hull in large multidimensional databases. In: Proceedings of the 3rd international conference on data warehousing and knowledge discovery, DaWaK \u201901. Springer, London, pp 294\u2013306","DOI":"10.1007\/3-540-44801-2_29"},{"key":"1063_CR4","unstructured":"Chorochronos (2011) Datasets and algorithms. \n                        http:\/\/www.rtreeportal.org\n                        \n                    . Accessed 30 Nov 2015"},{"issue":"1","key":"1063_CR5","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 \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -closest-pair queries in spatial databases. Data Knowl Eng 49(1):67\u2013104","journal-title":"Data Knowl Eng"},{"issue":"2","key":"1063_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02187835","volume":"7","author":"J Czyzowicz","year":"1992","unstructured":"Czyzowicz J, Rivera-Campo E, Urrutia J, Zaks J (1992) Separating convex sets in the plane. Discrete Comput Geom 7(2):189\u2013195","journal-title":"Discrete Comput Geom"},{"issue":"1","key":"1063_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"ME Dyer","year":"1984","unstructured":"Dyer ME (1984) Linear time algorithms for two- and three-variable linear programs. SIAM J Comput 13(1):31\u201345","journal-title":"SIAM J Comput"},{"key":"1063_CR8","doi-asserted-by":"crossref","unstructured":"Eldawy A, Mokbel MF (2015) The era of big spatial data. In: 2015 31st IEEE international conference on data engineering workshops (ICDEW). IEEE, pp 42\u201349 (2015)","DOI":"10.1109\/ICDEW.2015.7129542"},{"key":"1063_CR9","unstructured":"Fink M, Hershberger J, Kumar N, Suri S (2016) Hyperplane separability and convexity of probabilistic point sets. In: 32nd international symposium on computational geometry (SoCG 2016) volume 51 of Leibniz international proceedings in informatics (LIPIcs). Dagstuhl, pp 38:1\u201338:16"},{"issue":"2","key":"1063_CR10","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"},{"issue":"2","key":"1063_CR11","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 NR, Corral A (2014) The largest empty rectangle containing only a query object in spatial databases. GeoInformatica 18(2):193\u2013228","journal-title":"GeoInformatica"},{"issue":"2","key":"1063_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A Guttman","year":"1984","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. SIGMOD Rec 14(2):47\u201357","journal-title":"SIGMOD Rec"},{"key":"1063_CR13","unstructured":"Hadjieleftheriou M (2004) LibSpatialIndex. \n                        http:\/\/libspatialindex.org\/\n                        \n                    . Accessed 30 Nov 2015"},{"key":"1063_CR14","volume-title":"Principles of data mining","author":"DJ Hand","year":"2001","unstructured":"Hand DJ, Smyth P, Mannila H (2001) Principles of data mining. MIT Press, Cambridge"},{"issue":"2","key":"1063_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/276305.276326","volume":"27","author":"GR Hjaltason","year":"1998","unstructured":"Hjaltason GR, Samet H (1998) Incremental distance join algorithms for spatial databases. SIGMOD Rec 27(2):237\u2013248","journal-title":"SIGMOD Rec"},{"key":"1063_CR16","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, Secaucus"},{"issue":"1","key":"1063_CR17","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo N (1984) Linear programming in linear time when the dimension is fixed. J ACM 31(1):114\u2013127","journal-title":"J ACM"},{"issue":"6","key":"1063_CR18","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.compenvurbsys.2009.11.001","volume":"33","author":"J Mennis","year":"2009","unstructured":"Mennis J, Guo D (2009) Spatial data mining and geographic knowledge discovery\u2014an introduction. Comput Environ Urban Syst 33(6):403\u2013408","journal-title":"Comput Environ Urban Syst"},{"issue":"8","key":"1063_CR19","doi-asserted-by":"crossref","first-page":"506","DOI":"10.14778\/2002974.2002978","volume":"4","author":"S Nutanong","year":"2011","unstructured":"Nutanong S, Jacox EH, Samet H (2011) An incremental Hausdorff distance calculation algorithm. Proc VLDB Endow 4(8):506\u2013517","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"1063_CR20","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":"1063_CR21","unstructured":"Seara C (2002) On geometric separability. PhD thesis, Advisor: F. Hurtado. Universitat Politecnica de Catalunya, Barcelona"},{"key":"1063_CR22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R Seidel","year":"1991","unstructured":"Seidel R (1991) Small-dimensional linear programming and convex hulls made easy. Discrete Comput Geom 6:423\u2013434","journal-title":"Discrete Comput Geom"},{"issue":"9","key":"1063_CR23","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1016\/j.comgeo.2015.06.008","volume":"48","author":"F Sheikhi","year":"2015","unstructured":"Sheikhi F, Mohades A, de Berg M, Davoodi M (2015) Separating bichromatic point sets by l-shapes. Comput Geom 48(9):673\u2013687","journal-title":"Comput Geom"},{"key":"1063_CR24","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.comgeo.2016.10.001","volume":"61","author":"F Sheikhi","year":"2017","unstructured":"Sheikhi F, Mohades A, de Berg M, Mehrabi AD (2017) Separability of imprecise points. Comput Geom 61:24\u201337","journal-title":"Comput Geom"},{"key":"1063_CR25","volume-title":"Spatial databases\u2014a tour","author":"S Shekhar","year":"2003","unstructured":"Shekhar S, Chawla S (2003) Spatial databases\u2014a tour. Prentice Hall, Englewood Cliffs"},{"issue":"2","key":"1063_CR26","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BF01898355","volume":"1","author":"GT Toussaint","year":"1985","unstructured":"Toussaint GT (1985) A simple linear algorithm for intersecting convex polygons. Vis Comput 1(2):118\u2013123","journal-title":"Vis Comput"},{"key":"1063_CR27","doi-asserted-by":"crossref","unstructured":"Vatsavai RR, Ganguly A, Chandola V, Stefanidis A, Klasky S, Shekhar S (2012) Spatiotemporal data mining in the era of big spatial data: algorithms and applications. In: Proceedings of the 1st ACM SIGSPATIAL international workshop on analytics for big geospatial data. ACM, pp 1\u201310","DOI":"10.1145\/2447481.2447482"},{"key":"1063_CR28","unstructured":"Xue J, Li Y, Janardan R (2016) On the separability of stochastic geometric objects, with applications. In: 32nd international symposium on computational geometry (SoCG 2016) volume 51 of Leibniz international proceedings in informatics (LIPIcs), Dagstuhl, pp 62:1\u201362:16"},{"issue":"4","key":"1063_CR29","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/322276.322289","volume":"28","author":"AC-C Yao","year":"1981","unstructured":"Yao AC-C (1981) A lower bound to finding convex hulls. J ACM 28(4):780\u2013787","journal-title":"J ACM"},{"key":"1063_CR30","doi-asserted-by":"crossref","unstructured":"Yao B, Li F, Kumar P (2009) Reverse furthest neighbors in spatial databases. In: 2009 IEEE 25th international conference on data engineering. IEEE, pp 664\u2013675","DOI":"10.1109\/ICDE.2009.62"},{"key":"1063_CR31","doi-asserted-by":"crossref","unstructured":"Zhong Y, Han J, Zhang T, Li Z, Fang J, Chen G (2012) Towards parallel spatial query processing for big spatial data. In: Parallel and distributed processing symposium workshops & PhD forum (IPDPSW), 2012 IEEE 26th international. IEEE, pp 2085\u20132094","DOI":"10.1109\/IPDPSW.2012.245"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1063-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1063-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1063-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T15:34:30Z","timestamp":1516721670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1063-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,27]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["1063"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1063-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,27]]}}}