Faster algorithms for growing prioritized disks and rectangles☆
Keywords
Cited by (0)
- ☆
A preliminary version appeared as H.-K. Ahn, S.W. Bae, J. Choi, M. Korman, W. Mulzer, E. Oh, J.-W. Park, A. van Renssen, A. Vigneron. Faster Algorithms for Growing Prioritized Disks and Rectangles. Proc. 28th ISAAC, pp. 3:1–3:13. The work by H.-K. Ahn, J. Choi, E. Oh was supported by the MSIT (Ministry of Science and ICT), Korea, under the SW Starlab support program (IITP–2017–0–00905) supervised by the IITP (Institute for Information & communications Technology Promotion). S.W. Bae was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2015R1D1A1A01057220 and 2018R1D1A1B07042755). M. Korman was supported in part by National Science Foundation awards CCF-1422311 and KAKENHI No. 17K12635, Japan. W. Mulzer was supported in part by Deutsche Forschungsgemeinschaft Grants MU 3501/1 and MU 3501/2 and by European Research Council StG 757609. J.-W. Park was supported by the MSIT (Ministry of Science and ICT), Korea, under the Next-Generation Information Computing Development Program supervised by the National Research Foundation of Korea (NRF-2017M3C4A7066317). A. van Renssen was supported by JST ERATO Grant Number JPMJER1201, Japan. A. Vigneron was supported by the 2016 Research Fund (1.160054.01) of UNIST (Ulsan National Institute of Science and Technology).