3 research outputs found

    Agglomerative Clustering of Growing Squares

    Get PDF
    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 nn disjoint growing squares. Our data structure uses O(n(lognloglogn)2)O(n (\log n \log\log n)^2) space, supports queries in worst case O(log3n)O(\log^3 n) time, and updates in O(log7n)O(\log^7 n) amortized time. This leads to an O(nα(n)log7n)O(n\alpha(n)\log^7 n) time algorithm to solve the agglomerative clustering problem. This is a significant improvement over the current best O(n2)O(n^2) time algorithms.Comment: 14 pages, 7 figure

    Faster algorithms for growing prioritized disks and rectangles

    Get PDF
    Motivated by map labeling, we study the problem in which we are given a collection of n disks in the plane that grow at possibly different speeds. Whenever two disks meet, the one with the higher index disappears. This problem was introduced by Funke, Krumpe, and Storandt[IWOCA 2016]. We provide the first general subquadratic algorithm for computing the times and the order of disappearance. Our algorithm also works for other shapes (such as rectangles) and in any fixed dimension. Using quadtrees, we provide an alternative algorithm that runs in near linear time, although this second algorithm has a logarithmic dependence on either the ratio of the fastest speed to the slowest speed of disks or the spread of the disk centers (the ratio of the maximum to the minimum distance between them). Our result improves the running times of previous algorithms by Funke, Krumpe, and Storandt [IWOCA 2016], Bahrdt et al. [ALENEX 2017], and Funke and Storandt [EWCG 2017]. Finally, we give an \Omega(n\log n) lower bound on the problem, showing that our quadtree algorithms are almost tight

    Faster algorithms for growing prioritized disks and rectangles

    No full text
    Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of n disks in the plane. Initially, all disks have radius 0, and they grow at constant, but possibly different, speeds. Whenever two disks touch, the one with the higher index disappears. The goal is to determine the elimination order, i.e., the order in which the disks disappear. We provide the first general subquadratic algorithm for this problem. Our solution extends to other shapes (e.g., rectangles), and it works in any fixed dimension. We also describe an alternative algorithm that is based on quadtrees. Its running time is O (n(logn + min{log Delta, log Phi})), where Delta is the ratio of the fastest and the slowest growth rate and Phi is the ratio of the largest and the smallest distance between two disk centers. This improves the running times of previous algorithms by Funke, Krumpe, and Storandt [IWOCA 2016], Bahrdt et al. [ALENEX 2017], and Funke and Storandt [EuroCG 2017]. Finally, we give an Omega(n logn) lower bound, showing that our quadtree algorithms are almost tight
    corecore