{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T16:20:35Z","timestamp":1723566035568},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1007\/bf01890985","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T14:23:06Z","timestamp":1120573386000},"page":"31-38","source":"Crossref","is-referenced-by-count":7,"title":["Clustering methods for geometric objects and applications to design problems"],"prefix":"10.1007","volume":"2","author":[{"given":"F.","family":"Dehne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Noltemeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01890985_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, Chazelle, Guibas, O'Dunlaing, yap (1985) Parallel computational geometry. IEEE Proc. Foundation of Comput Sci., Portland Oregon","DOI":"10.1109\/SFCS.1985.42"},{"key":"BF01890985_CR2","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading, MA, USA"},{"key":"BF01890985_CR3","doi-asserted-by":"crossref","unstructured":"Chew P, Drysdale RL (1985) Voronoi diagrams based on convex distance functions. Proc 1st Symp on Comput Geom, Baltimore, MD, USA","DOI":"10.1145\/323233.323264"},{"key":"BF01890985_CR4","unstructured":"Dehne F (1983) AnO(N4) algorithm to construct all voronoi diagrams forK nearest neighbor searching, Proc 10th Colloq. on Automata, Languages and Programming"},{"key":"BF01890985_CR5","volume-title":"Efficient algorithms for agglomerative hierarchical clustering methods","author":"WHE Day","year":"1983","unstructured":"Day WHE, Edelsbrunner H (1983) Efficient algorithms for agglomerative hierarchical clustering methods. Rep F122, Inst Inf, TU Graz, Graz, Austria"},{"key":"BF01890985_CR6","doi-asserted-by":"crossref","unstructured":"Dubes R, Jain AK (1980) Clustering methodologies in exploratory data analysis. In: Yovits MC (ed) Adv Comput 19:113\u2013228","DOI":"10.1016\/S0065-2458(08)60034-0"},{"key":"BF01890985_CR7","series-title":"Proc Comput Graph Tokyo","volume-title":"Clustering geometric objects and applications to layout problems","author":"F Dehne","year":"1985","unstructured":"Dehne F, Noltemeier H (1985a Clustering geometric objects and applications to layout problems. Proc Comput Graph Tokyo, Springer, Tokyo"},{"key":"BF01890985_CR8","doi-asserted-by":"crossref","unstructured":"Dehne F, Noltemeier H (1985b) A computational geometry approach to clustering problems. Proc 1st ACM Siggraph Symp Comput Geom, Baltimore, MD, USA","DOI":"10.1145\/323233.323265"},{"key":"BF01890985_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01890985","volume":"2","author":"F Dehne","year":"1985","unstructured":"Dehne F, Noltemeier H (1985c) Clustering methods for geometric objects and applications to design problems. The Visual Computer 2:31\u201338","journal-title":"The Visual Computer"},{"key":"BF01890985_CR10","doi-asserted-by":"crossref","unstructured":"Deday E, Simon JC (1980) Clustering analysis. In: Fu KS (ed) Digital Pattern Recognition, Springer","DOI":"10.1007\/978-3-642-67740-3_3"},{"key":"BF01890985_CR11","volume-title":"On the shape of a set of points in the euclidean plane","author":"H Edelsbrunner","year":"1981","unstructured":"Edelsbrunner H, Kirkpatrick DG, Seidel R (1981) On the shape of a set of points in the euclidean plane. Rep F71, Inst Inf, TU Graz, Graz, Austria, 1981"},{"key":"BF01890985_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"DT Lee","year":"1981","unstructured":"Lee DT, Drysdale RL (1981) Generalization of voronoi diagrams in the plane. SIAM J Comput 10:73\u201387","journal-title":"SIAM J Comput"},{"key":"BF01890985_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(83)90095-9","volume":"16","author":"F Murtagh","year":"1983","unstructured":"Murtagh F (1983) Expected-time complexity results for hierarchic clustering algorithms which use cluster centers. Inf Proc Lett 16:237\u2013241","journal-title":"Inf Proc Lett"},{"key":"BF01890985_CR14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/355616.355617","volume":"17","author":"RL Page","year":"1974","unstructured":"Page RL (1974) A minimum spanning tree clustering method. Commun ACM 17:321\u2013324","journal-title":"Commun ACM"},{"key":"BF01890985_CR15","first-page":"93","volume":"16","author":"FJ Rohlf","year":"1973","unstructured":"Rohlf FJ (1973) Hierarchical clustering using the minimum spanning tree. Comput J 16:93\u201395","journal-title":"Comput J"},{"key":"BF01890985_CR16","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0166-218X(83)90083-5","volume":"6","author":"R Schrader","year":"1983","unstructured":"Schrader R (1983) Approximations of clustering and subgraph problems on trees. Discrete Appl Math 6:301\u2013309","journal-title":"Discrete Appl Math"},{"key":"BF01890985_CR17","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey D (1975) Closest point problems. Proc 16th Ann IEEE Symp Found Comp Sci","DOI":"10.1109\/SFCS.1975.8"},{"key":"BF01890985_CR18","doi-asserted-by":"crossref","unstructured":"Yao FF (1983) A 3-space partition and its application (Extended Abstract. Proc 15th ACM Symp Theor Comp","DOI":"10.1145\/800061.808755"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01890985.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01890985\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01890985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:32:10Z","timestamp":1586320330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01890985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["BF01890985"],"URL":"https:\/\/doi.org\/10.1007\/bf01890985","relation":{},"ISSN":["0178-2789","1432-8726"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-8726","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}