1. Aloupis, G., Barba, L., Langerman, S.: Circle separability queries in logarithmic time. In: Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG’12), pp. 121–125 (2012)
2. Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data structures for halfplane proximity queries and incremental Voronoi diagrams. LATIN 2006: Theoretical Informatics. Lecture Notes in Computer Science, vol. 3887, pp. 80–92. Springer, Berlin (2006)
3. Barba, L.: Disk constrained 1-center queries. In: Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG’12), pp. 15–19 (2012)
4. Bentley, J.L., Saxe, J.B.: Decomposable searching problems I. Static-to-dynamic transformation. J. Algorithm. 1(4), 301–358 (1980)
5. Bose, P., Langerman, S., Roy, S.: Smallest enclosing circle centered on a query line segment. In: Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG’08), pp. 167–170 (2008)