Computational Geometry: Clustering

• T. Asano, H. Imai, and K. Imai: Clustering/Hashing Points in the Plane with Maxmin Criteria, IPSJ SIG Notes 89-AL-7-1, IPSJ, June 1989. Abstract
• S. Hasegawa, H. Imai, M. Inaba, N. Katoh, and J. Nakano: Efficient Algorithms for Variance-Based k-Clustering, in Proceedings of the 1st Pacific Conference on Computer Graphics and Applications (Pacific Graphics'93), pp. 75-89, Seoul, 1993. Paper(ps) Paper(dvi)
• S. Hasegawa, H. Imai, M. Inaba, N. Katoh, and J. Nakano: Efficient Algorithms for Variance-Based k-Clustering, IPSJ SIG Notes 93-AL-33-12, IPSJ, 1993.
• S. Hasegawa, H. Imai, M. Inaba, N. Katoh, and J. Nakano: Efficient Algorithms for Variance-Based k-Clustering, in ISM Joint-Research Reports, 1994, Institute of Statistical Mathematics. Abstract Paper(ps)
• H. Imai and M. Inaba: Geometric Clustering with Applications, in The Third International Congress on Industrial and Applied Mathematics (ICIAM 95), Book of Abstracts, p. 124, 1995. Abstract Paper(ps)
• M. Inaba, H. Imai, and N. Katoh: Experimental Results of Randomized Clustering Algorithm, in Proceedings of the 12th ACM Symposium on Computational Geometry: Communication Section, 1996, ACM. Abstract Paper(ps)
• M. Inaba, N. Katoh, and H. Imai: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering, in Proceedings of the 10th ACM Symposium on Computational Geometry, pp. 332-339, 1994, ACM. Paper(dvi) Paper(ps)
• M. Inaba, N. Katoh, and H. Imai: Algorithms for Variance-Based k-Clustering Based on Weighted Voronoi Diagrams and Randomization, in ISM Reports on Statistical Computing, ``Optimization: Modeling and Algorithms'', Vol. 61, pp. 73-80, 1994, Institute of Statistical Mathematics.