J. E. Bresenham, Algorithm for computer control of a digital plotter, IBM Systems Journal, vol.4, issue.1, pp.25-30, 1965.
DOI : 10.1147/sj.41.0025

J. G. Cleary and G. Wyvill, Analysis of an algorithm for fast ray tracing using uniform space subdivision, The Visual Computer, vol.6, issue.4, pp.65-83, 1988.
DOI : 10.1007/BF01905559

F. Ellis, Vector Overlay Processing?Specific Theory GIS Self Learning Tool?University of Melbourne, Department of Geomatics, p.22, 2001.

M. Etzion and A. Rappoport, On compatible star decompositions of simple polygons, IEEE Transactions on Visualization and Computer Graphics, vol.3, issue.1, pp.87-95, 1997.
DOI : 10.1109/2945.582388

F. R. Feito, J. C. Torres, and A. Urena, Orientation, simplicity, and inclusion test for planar polygons, Computers & Graphics, vol.19, issue.4, pp.595-600, 1995.
DOI : 10.1016/0097-8493(95)00037-D

A. Fujimoto and K. Iwata, Jag-Free Images on Raster Displays, IEEE Computer Graphics and Applications, vol.3, issue.9, pp.26-34, 1983.
DOI : 10.1109/MCG.1983.263354

A. Fujimoto, T. Tanaka, and K. Iwata, ARTS: Accelerated Ray-Tracing System, IEEE Computer Graphics and Applications, vol.6, issue.4, pp.16-26, 1986.
DOI : 10.1109/MCG.1986.276715

M. Gombosi and B. Zalik, Point-in-polygon tests for geometric buffers, Computers & Geosciences, vol.31, issue.10, pp.1201-1212, 2005.
DOI : 10.1016/j.cageo.2005.03.009

K. Hormann and A. Agathos, The point in polygon problem for arbitrary polygons, Computational Geometry, vol.20, issue.3, pp.131-144, 2001.
DOI : 10.1016/S0925-7721(01)00012-8

C. W. Huang and T. Y. Shih, On the complexity of point-in-polygon algorithms, Computers & Geosciences, vol.23, issue.1, pp.109-118, 1997.
DOI : 10.1016/S0098-3004(96)00071-4

J. J. Jimé-nez, F. R. Feito, and R. J. Segura, A new hierarchical triangle-based point-in-polygon data structure, Computers & Geosciences, vol.35, issue.9, pp.1843-1853, 2009.
DOI : 10.1016/j.cageo.2008.09.013

J. Li, W. C. Wang, and E. H. Wu, Point-in-polygon tests by convex decomposition, Computers & Graphics, vol.31, issue.4, pp.636-648, 2007.
DOI : 10.1016/j.cag.2007.03.002

F. Martinez, A. J. Rueda, and F. R. Feito, The multi-L-REP decomposition and its application to a point-in-polygon inclusion test, Computers & Graphics, vol.30, issue.6, pp.947-958, 2006.
DOI : 10.1016/j.cag.2006.08.015

S. Nordbeck and B. Rystedt, Computer cartography point-in-polygon programs, BIT, vol.7, issue.1, pp.39-64, 1967.
DOI : 10.1007/BF01934125

F. P. Preparata and M. I. Shamos, In: Computational Geometry: An Introduction, 1991.

O. 'rourke and J. , In: Computational Geometry in C, p.pp, 2000.

K. B. Salomon, An efficient point-in-polygon algorithm, Computers & Geosciences, vol.4, issue.2, pp.173-178, 1978.
DOI : 10.1016/0098-3004(78)90085-7

G. Taylor, POINT IN POLYGON TEST, Survey Review, vol.32, issue.254, pp.479-484, 1994.
DOI : 10.1007/978-1-4684-9367-2

W. C. Wang, J. Li, and E. H. Wu, 2D point-in-polygon test by classifying edges into layers, Computers & Graphics, vol.29, issue.3, pp.427-439, 2005.
DOI : 10.1016/j.cag.2005.03.001

B. Zalik, G. Clapworthy, and C. Oblonsek, An Efficient Code-Based Voxel-Traversing Algorithm, Computer Graphics Forum, vol.16, issue.2, pp.119-128, 1997.
DOI : 10.1111/1467-8659.00128

B. Zalik and I. Kolingerova, A cell-based point-in-polygon algorithm suitable for large sets of points, Computers & Geosciences, vol.27, issue.10, pp.1135-1145, 2001.
DOI : 10.1016/S0098-3004(01)00037-1