Publisher
Springer Nature Switzerland
Reference47 articles.
1. Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms 12(1), 38–56 (1991)
2. Ahn, H., Barba, L., Bose, P., De Carufel, J.L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. Discrete Comput. Geom. 56(4), 836–859 (2016)
3. Aichholzer, O., Hackl, T., Korman, M., Pilz, A., Vogtenhuber, B.: Geodesic-preserving polygon simplification. Int. J. Comput. Geom. Appl. 24(4), 307–324 (2014)
4. Alexandrescu, A.: Fast deterministic selection. In: SEA. LIPIcs, vol. 75, pp. 24:1–24:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
5. Aronov, B.: On the geodesic Voronoi diagram of point sites in a simple polygon. Algorithmica 4(1), 109–140 (1989)