Computing the convex hull of line intersections, Journal of Algorithms, vol.7, issue.2, pp.285-288, 1986. ,
DOI : 10.1016/0196-6774(86)90010-6
Optimal output-sensitive convex hull algorithms in two and three dimensions, Discrete & Computational Geometry, vol.6, issue.4, pp.361-368, 1996. ,
DOI : 10.1007/BF02712873
Finding the diameter of a set of lines, Pattern Recognition, vol.18, issue.3-4, pp.249-255, 1985. ,
DOI : 10.1016/0031-3203(85)90050-0
Convex Hulls for Random Lines, Journal of Algorithms, vol.14, issue.3, pp.381-394, 1993. ,
DOI : 10.1006/jagm.1993.1020
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4762
An efficient algorith for determining the convex hull of a finite planar set, Information Processing Letters, vol.1, issue.4, pp.132-13318, 1972. ,
DOI : 10.1016/0020-0190(72)90045-2
The Ultimate Planar Convex Hull Algorithm?, SIAM Journal on Computing, vol.15, issue.1, pp.287-299, 1986. ,
DOI : 10.1137/0215021
The convex hull for random lines in the plane, Proceedings of the Japan Conference on Discrete and Computational Geometry, 2002. ,
On-line construction of the convex hull of a simple polyline, Information Processing Letters, vol.25, issue.1, pp.11-12, 1987. ,
DOI : 10.1016/0020-0190(87)90086-X
Computational Geometry: An Introduction, 1986. ,
DOI : 10.1007/978-1-4612-1098-6
Introduction to Algorithms, 2000. ,