1. Lect Notes Comput Sci;E.G. Anagnostou,1990
2. E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, and T.-C. Yang, “On minimum-area hulls,” Algorithmica, Vol. 21, 1998, pp. 119–136.
3. T. Asano, L.J. Guibas, and T. Tokuyama, “Walking in an arrangement topologi-cally,” International Journal of Computational Geometry and Applications, Vol. 4, No. 2, 1994, pp. 123–151.
4. T. Asano and T. Tokuyama, “Topological walk revisited,” Proc. 6th Canadian Conf. on Computational Geometry, 1994, pp. 1–6.
5. P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, “Approximating shortest paths in arrangements of lines,” Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 143–148.