Peter Schorn, and Frederick Fisher. “Testing the convexity of a polygon.” Graphics Gems IV. Academic Press Professional, Inc., 1994.
 Eric Haines. “Point in polygon strategies.” Graphics Gems IV. Academic Press Professional, Inc., 1994.
 Franco P. Preparata, and Michael Ian Shamos. Computational Geometry: An Introduction. 1985.
 Joseph O’Rourke. Computational Geometry in C. Cambridge university press, 1998.
 Philip J. Schneider, and David H. Eberly. Geometric Tools for Computer Graphics. Morgan Kaufmann, 2002.
 Kevin Weiler. “An incremental angle point in polygon test.” Graphics Gems IV. Academic Press Professional, Inc., 1994.
 F. Hill, and S. Kelley. Computer Graphics Using OpenGL, 3/E. Pearson, 2007.
 Mike Cyrus, and Jay Beck. “Generalized two-and three-dimensional clipping.” Computers & Graphics, vol.3, no.1, pp.23-28, 1978.
 Jan van Leeuwen, and Anneke A. Schoone. “Untangling a traveling salesman tour in the plane.” Rijksuniversiteit. Vakgroep Informatica, 1980.
 Deneen Linda, and Gary Shute. “Polygonizations of point sets in the plane.” Discrete & Computational Geometry. vol.3, no.1, pp.77-87, 1988.
 Chong Zhu, et al. “Generating random polygons with given vertices.” Computational Geometry, vol.6, no.5, pp.277-290, 1996.
 Thomas Auer, and Martin Held. “Rpg-heuristics for the generation of random polygons.” Proc. 8th Canada Conf. Comput. Geom. Ottawa, Canada, pp.38-44, 1996.
 Lee, D. T., and Franco P. Preparata. “Location of a point in a planar subdivision and its applications.” SIAM Journal on Computing, vol.6, no.3, pp.594-606, 1977.
 David Dailey, and Deborah Whitfield. “Constructing random polygons.” Proceedings of the 9th ACM SIGITE conference on Information technology education. ACM, 2008.
 Christian Sohler. “Generating random star-shaped polygons.” CCCG. 1999.
 Franco P. Preparata, and Kenneth J. Supowit. “Testing a simple polygon for monotonicity.” Information Processing Letters, vol.12, no.4, pp.161-164, 1981.
 Der-Tsai Lee, and Franco P. Preparata. “An optimal algorithm for finding the kernel of a polygon.” Journal of the ACM (JACM), vol.26, no.3, pp.415-421, 1979.
 周培德. 计算几何: 算法分析与设计. 清华大学出版社, 2000.
 Joseph O’Rourke, and Mandira Virmani. “Generating random polygons.” Technical Report 011, CS Dept., Smith College, Northampton, MA 01063, 1991.
 Olivier Devillers, Philippe Duchon, and Rémy Thomasse. “A generator of random convex polygons in a disc.” 2014.
 Dan Sunday. “Geometry Algorithms Home.” website, <http://geomalgorithms.com/>, last access in April 2014.
 Dan Sunday. “Area of Triangles and Polygons.” website, <http://geomalgorithms.com/a01-_area.html>, last access in October 2014.
 Ronald N. Goldman. “Area of planar polygons and volume of polyhedra.” Graphics Gems II, pp.170-171, 1991.
 Allen Van Gelder. ” Efficient Computation of Polygon Area and Polyhedron Volume.” Graphics Gems V, pp.35-41, 1995.
 Michael Ian Shamos, and Dan Hoey. “Geometric intersection problems.” Foundations of Computer Science, 1976., 17th Annual Symposium on. IEEE, 1976.
 Sang C. Park, Hayong Shin, and Byoung K. Choi. “A sweep line algorithm for polygonal chain intersection and its applications.” Geometric Modelling. Springer US, pp.309-321, 2001.
 Dan Sunday. “Intersections of a Set of Segments” website, <http://geomalgorithms.com/a09-_intersect-3.html>, last access in September, 2014.
 Duncan McCallum, and David Avis. “A linear algorithm for finding the convex hull of a simple polygon.” Information Processing Letters, vol.9, no.5, pp.201-206, 1979.
 Der-Tsai Lee. “On finding the convex hull of a simple polygon.” International journal of computer & information sciences, vo.12, no.2, pp.87-98, 1983.
 Ronald L. Graham, and F. Frances Yao. “Finding the convex hull of a simple polygon.” Journal of Algorithms, vo.4, no.4, pp.324-331, 1983.
 Hossam ElGindy, David Avis, and G. Toussaint. “Applications of a two-dimensional hidden-line algorithm to other geometric problems.” Computing, vol.31, no.3, pp.191-202, 1983.
 Marian Orlowski. “A convex hull algorithm for planar simple polygons.” Pattern recognition, vol.18, no.5, pp.361-366, 1985.
 Sung Yong Shin, and Tony C. Woo. “Finding the convex hull of a simple polygon in linear time.” Pattern Recognition, vo.19, no.6, pp.453-458, 1986.
 Avraham A Melkman. “On-line construction of the convex hull of a simple polyline.” Information Processing Letters, vol.25, no.1, pp.11-12, 1987.