Abstract
Clustering of geometric objects is a very familiar and important problem in many different areas of applications as well as in the theoretical foundation of some modern fields of computer science. This paper describes how design problems, especially the design of an assembly line, can be transformed into a clustering problem. In order to solve the problem for large sizes of input data we introduce a structure, called Voronoi Tree, which applied to our real world data (assembly line design) did not only reduce the time to get a feasible design of an assembly line dramatically, but additionally increased the value of the design by more than 30% (in comparison with standard design methods). In addition to this we introduce a clustering method which is of interest for those applications which can be transformed to planar clustering problems. In this particular case it is possible to compute an (hierarchically) optimized clustering with resp. to a large class of clustering measures in timeO(nn1/2log3 n+U F(n)nn1/2+P F(n)) [n: number of points;U F(n), PF(n) dependent on the chosen clustering measure].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, Chazelle, Guibas, O'Dunlaing, yap (1985) Parallel computational geometry. IEEE Proc. Foundation of Comput Sci., Portland Oregon
Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading, MA, USA
Chew P, Drysdale RL (1985) Voronoi diagrams based on convex distance functions. Proc 1st Symp on Comput Geom, Baltimore, MD, USA
Dehne F (1983) AnO(N4) algorithm to construct all voronoi diagrams forK nearest neighbor searching, Proc 10th Colloq. on Automata, Languages and Programming
Day WHE, Edelsbrunner H (1983) Efficient algorithms for agglomerative hierarchical clustering methods. Rep F122, Inst Inf, TU Graz, Graz, Austria
Dubes R, Jain AK (1980) Clustering methodologies in exploratory data analysis. In: Yovits MC (ed) Adv Comput 19:113–228
Dehne F, Noltemeier H (1985a Clustering geometric objects and applications to layout problems. Proc Comput Graph Tokyo, Springer, Tokyo
Dehne F, Noltemeier H (1985b) A computational geometry approach to clustering problems. Proc 1st ACM Siggraph Symp Comput Geom, Baltimore, MD, USA
Dehne F, Noltemeier H (1985c) Clustering methods for geometric objects and applications to design problems. The Visual Computer 2:31–38
Deday E, Simon JC (1980) Clustering analysis. In: Fu KS (ed) Digital Pattern Recognition, Springer
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
Lee DT, Drysdale RL (1981) Generalization of voronoi diagrams in the plane. SIAM J Comput 10:73–87
Murtagh F (1983) Expected-time complexity results for hierarchic clustering algorithms which use cluster centers. Inf Proc Lett 16:237–241
Page RL (1974) A minimum spanning tree clustering method. Commun ACM 17:321–324
Rohlf FJ (1973) Hierarchical clustering using the minimum spanning tree. Comput J 16:93–95
Schrader R (1983) Approximations of clustering and subgraph problems on trees. Discrete Appl Math 6:301–309
Shamos MI, Hoey D (1975) Closest point problems. Proc 16th Ann IEEE Symp Found Comp Sci
Yao FF (1983) A 3-space partition and its application (Extended Abstract. Proc 15th ACM Symp Theor Comp
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dehne, F., Noltemeier, H. Clustering methods for geometric objects and applications to design problems. The Visual Computer 2, 31–38 (1986). https://doi.org/10.1007/BF01890985
Issue Date:
DOI: https://doi.org/10.1007/BF01890985