1. Garey M.R, and Johnson D.S. 1979. Computers and intractability: A Guide to the Theory of NPCompleteness. Freeman San Francisco, California, USA.
2. Cheng, Q, Chrobak, M., and Sundaram, G. 2000. Computing simple paths among obstacles. Comput.Geom, 2000(16), 223--233.
3. Lijuan Wang, Bo Jiang, Qi Wei, and Dandan He. 2014. Research on the Algorithm for Euclidean Shortest Paths of Visiting Line Segments in the Plane, ICIC Express Letters, 2014, 8(6), 1683--1688.
4. Maarten Löffler and Marc van Kreveld. 2008. Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica, 2008.
5. Rappaport, D. 1995. Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 1995, 5(3), 243--256.