File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Faster algorithms for growing prioritized disks and rectangles

Author(s)
Ahn, Hee-KapBae, Sang WonChoi, JongminKorman, MatiasMulzer, WolfgangOh, EunjinPark, Ji-wonvan Renssen, AndreVigneron, Antoine
Issued Date
2019-07
DOI
10.1016/j.comgeo.2019.02.001
URI
https://scholarworks.unist.ac.kr/handle/201301/26575
Fulltext
https://www.sciencedirect.com/science/article/pii/S0925772119300252
Citation
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.80, pp.23 - 39
Abstract
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.
Publisher
Elsevier B.V.
ISSN
0925-7721
Keyword (Author)
Elimination orderQuadtreeCondition numberLower boundData structures

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.