{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:48:46Z","timestamp":1773348526260,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540548911","type":"print"},{"value":"9783540464594","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54891-2_20","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:16:39Z","timestamp":1330211799000},"page":"265-275","source":"Crossref","is-referenced-by-count":15,"title":["A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted data"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Schreiber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"No.2","key":"20_CR1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","volume":"24","author":"A. Bowyer","year":"1981","unstructured":"A. Bowyer: Computing Dirichlet tesselations, Comp. Journal, Vol. 24, No. 2, 1981, 162\u2013166.","journal-title":"Comp. Journal"},{"key":"20_CR2","volume-title":"Masters Thesis","author":"T. Dierks","year":"1990","unstructured":"T. Dierks: The Modelling and Visualization of Scattered Volumetric Data, Masters Thesis, Arizona State University, USA, Dec. 1990."},{"key":"20_CR3","volume-title":"Clustering Algorithms","author":"J. A. Hartigan","year":"1975","unstructured":"J. A. Hartigan: Clustering Algorithms, Wiley, New York, 1975."},{"issue":"3","key":"20_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/965145.801294","volume":"16","author":"P. Heckbert","year":"1982","unstructured":"P. Heckbert: Color image quantization for frame buffer display, ACM Trans. Computer Graphics 16, 3 (July 1982), 297\u2013304.","journal-title":"ACM Trans. Computer Graphics"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"I. Hyafil","year":"1976","unstructured":"I. Hyafil, R. L. Rivest: Construction optimal binary decision trees is NP-complete, Inf. Process. Lett. 5, May 1976, 15\u201317.","journal-title":"Inf. Process. Lett."},{"key":"20_CR6","volume-title":"Masters Thesis","author":"J. R. McMahon","year":"1986","unstructured":"J. R. McMahon: Knot Selection for Least Squares Approximation using Thin Plate Splines, Masters Thesis, Naval Postgraduate School, Monterey, USA, June 1986."},{"key":"20_CR7","unstructured":"J. R. McMahon, R. Franke: An Enhanced Knot Selection Algorithm for Least Squares Approximation using Thin Plate Splines, ARO Report 90-1, Trans. of the Seventh Army, Conf. on Applied Math. and Computing."},{"issue":"No.3","key":"20_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1145\/79505.79512","volume":"16","author":"O. Palacios-Velez","year":"1990","unstructured":"O. Palacios-Velez, B. C. Renaud: A Dynamic Hierarchical Subdivision Algorithm for Computing Delaunay Triangulations and Other Closest-Point Problems, ACM Trans. on Math. Soft., Vol. 16, No. 3, Sept. 1990, 275\u2013292.","journal-title":"ACM Trans. on Math. Soft."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"F. P. Preparata, M. I. Shamos: Computational Geometry, Springer, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"20_CR10","first-page":"81","volume":"1","author":"S. Z. Selim","year":"1986","unstructured":"S. Z. Selim, M. A. Ismail: K-means-type algorithms: A generalized convergence theorem and characterization of local optimality, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6, 1 (1986), 81\u201387.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6"},{"issue":"No.2","key":"20_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/45054.45056","volume":"14","author":"S. J. Wan","year":"1988","unstructured":"S. J. Wan, S. K. M. Wong, P. Prusinkiewicz: An Algorithm for Multidimensional Data Clustering, ACM Trans. on Math. Soft., Vol. 14, No. 2, June 1988, 153\u2013162.","journal-title":"ACM Trans. on Math. Soft."},{"issue":"No.2","key":"20_CR12","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/comjnl\/24.2.167","volume":"24","author":"D. F. Watson","year":"1981","unstructured":"D. F. Watson: Computing the n-dimensional Delaunay tesselation with application to Voronoi polytops, Comp. Journal, Vol. 24, No. 2, 1981, 162\u2013166.","journal-title":"Comp. Journal"},{"key":"20_CR13","volume-title":"A fast k-means type clustering algorithm","author":"X. Wu","year":"1985","unstructured":"X. Wu, I. H. Witten: A fast k-means type clustering algorithm, Dept. Computer Science, Univ. of Calgary, Canada, May 1985."}],"container-title":["Lecture Notes in Computer Science","Computational Geometry-Methods, Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54891-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:25:57Z","timestamp":1619573157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54891-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540548911","9783540464594"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-54891-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}