We study an agglomerative clustering problem motivated by interactive glyphs in geo-visualization. Consider a set of disjoint square glyphs on an interactive map. When the user zooms out, the glyphs grow in size relative to the map, possibly with different speeds. When two glyphs intersect, we wish to replace them by a new glyph that captures the information of the intersecting glyphs. We present a fully dynamic kinetic data structure that maintains a set of n disjoint growing squares. Our data structure uses O(n(log nlog log n) 2) space, supports queries in worst case O(log 3n) time, and updates in O(log 7n) amortized time. This leads to an O(nα(n) log 7n) time algorithm (where α is the inverse Ackermann function) to solve the agglomerative clustering problem, which is a significant improvement over the straightforward O(n2log n) time algorithm.
CITATION STYLE
Castermans, T., Speckmann, B., Staals, F., & Verbeek, K. (2018). Agglomerative clustering of growing squares. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10807 LNCS, pp. 260–274). Springer Verlag. https://doi.org/10.1007/978-3-319-77404-6_20
Mendeley helps you to discover research relevant for your work.