1. Agarwal, P.K., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms 5(1), 4:1–4:37 (2008)
2. Ahn, H.-K., Bae, S.W., Choi, J., Korman, M., Mulzer, W., Oh, E., Park, J.-W., van Renssen, A., Vigneron, A.: Faster algorithms for growing prioritized disks and rectangles. In: International Symposium on Symbolic and Algebraic Computation, pp. 1–13 (2017)
3. Alexandron, G., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. Theory Appl. 36(2), 144–1158 (2007)
4. Bahrdt, D., Becher, M., Funke, S., Krumpe, F., Nusser, A., Seybold, M., Storandt, S.: Growing balls in $$\mathbb{R}^d$$ R d . In: Proceedings of the 19th Workshop on Algorithm Engineering and Experiments, pp. 247–258 (2017)
5. Castermans, T., Speckmann, B., Staals, F., Verbeek, K.: Agglomerative clustering of growing squares. ArXiv e-prints (2017)