1. Aggarwal, A., Guibas, L., Saxe, J., Shor, P.: A linear time algorithm for computing the Voronoi diagram of a convex polygon. In: Proceedings of STOC, pp. 39–45. ACM, New York (1987)
2. Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of STOC, pp. 80–86. ACM, New York (1983)
3. Bose, P., Langerman, S., Roy, S.: Smallest enclosing circle centered on a query line segment. In: Proceedings of CCCG, pp. 167–170 (2008)
4. Bose, P., Toussaint, G.: Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications. In: Proceedings of CGI, pp. 102–111 (1996)
5. Lecture Notes in Computer Science;P. Bose,2002