http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Mulzer, Wolfgang (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
Faster algorithms for growing prioritized disks and rectangles
Ahn, Hee-Kap,Bae, Sang Won,Choi, Jongmin,Korman, Matias,Mulzer, Wolfgang,Oh, Eunjin,Park, Ji-won,van Renssen, André,Vigneron, Antoine Elsevier 2019 Computational geometry Vol.80 No.-
<P><B>Abstract</B></P> <P>Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of <I>n</I> 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.</P> <P>We also describe an alternative algorithm that is based on quadtrees. Its running time is O ( n ( log n + min { log Δ , log Φ } ) ) , where Δ is the ratio of the fastest and the slowest growth rate and Φ 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].</P> <P>Finally, we give an Ω ( n log n ) lower bound, showing that our quadtree algorithms are almost tight.</P>
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
