{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:51Z","timestamp":1725470751466},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_37","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"399-410","source":"Crossref","is-referenced-by-count":6,"title":["Region-Restricted Clustering for Geographic Data Mining"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/S0097539795281840","volume":"27","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., de Berg, M., Matou\u0161ek, J., Schwarzkopf, O.: Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput.\u00a027, 654\u2013667 (1998)","journal-title":"SIAM J. Comput."},{"key":"37_CR2","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry, Contemporary Mathematics","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol.\u00a0223, pp. 1\u201356. American Mathematical Society, Providence (1999)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A. Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms\u00a012, 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"5","key":"37_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01182771","volume":"11","author":"B. Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica\u00a011, 116\u2013132 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"37_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica\u00a01(3), 133\u2013162 (1986)","journal-title":"Algorithmica"},{"key":"37_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jagm.1995.1048","volume":"19","author":"A. Datta","year":"1995","unstructured":"Datta, A., Lenhof, H.-P., Schwarz, C., Smid, M.: Static and dynamic algorithms for k-point clustering problems. J. Algorithms\u00a019, 474\u2013503 (1995)","journal-title":"J. Algorithms"},{"key":"37_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom.\u00a011, 321\u2013350 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., van Kreveld, M., Narasimhan, G.: Region-restricted clustering for geographic data mining. Technical Report UU-CS-2006-031, Department of Information and Computing Sciences, Utrecht University (2006)","DOI":"10.1007\/11841036_37"},{"key":"37_CR12","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Academic Press, San Diego (2001)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1123-0","volume":"41","author":"S. Har-Peled","year":"2005","unstructured":"Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica\u00a041, 147\u2013157 (2005)","journal-title":"Algorithmica"},{"key":"37_CR14","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. John Wiley & Sons, New York (1975)"},{"key":"37_CR15","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Computing Surveys\u00a031, 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"key":"37_CR17","unstructured":"Koperski, K., Adhikary, J., Han, J.: Spatial data mining: Progress and challenges. In: Proc. SIGMOD 1996 Workshop on Research Issues on Data Mining and Knowledge Discovery (1996)"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1982.1675946","volume":"C-31","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T.: On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput.\u00a0C-31, 478\u2013487 (1982)","journal-title":"IEEE Trans. Comput."},{"volume-title":"Geographic Data Mining and Knowledge Discovery","year":"2001","key":"37_CR19","unstructured":"Miller, H.J., Han, J. (eds.): Geographic Data Mining and Knowledge Discovery. Taylor & Francis, London (2001)"},{"key":"37_CR20","volume-title":"Geographic Information Analysis","author":"D. O\u2019Sullivan","year":"2003","unstructured":"O\u2019Sullivan, D., Unwin, D.J.: Geographic Information Analysis. John Wiley & Sons, Hoboken (2003)"},{"key":"37_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45244-3_12","volume-title":"Temporal, Spatial, and Spatio-Temporal Data Mining","author":"J. Roddick","year":"2001","unstructured":"Roddick, J., Hornsby, K., Spiliopoulou, M.: An updated bibliography of temporal, spatial, and spatio-temporal data mining research. In: Roddick, J.F., Hornsby, K.S. (eds.) TSDM 2000. LNCS, vol.\u00a02007, pp. 147\u2013163. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T02:15:14Z","timestamp":1627784114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11841036_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}