Kalay, Y.E.,
Determining the Spatial Containment of a Point in General Polyhedra,
CGIP(19), No. 4, August 1982, pp. 303-334.
WWW Version.
BibRef
8208
Horn, W.P.,
Taylor, D.L.,
A Theorem to Determine the Spatial Containment of a
Point in a Planar Polyhedron,
CVGIP(45), No. 1, January 1989, pp. 106-116.
WWW Version.
BibRef
8901
Lane, J.,
Magedson, B.,
Rarick, M.,
An Efficient Point in Polyhedron Algorithm,
CVGIP(26), No. 1, April 1984, pp. 118-125.
WWW Version.
BibRef
8404
Chen, L.T.,
Davis, L.S.,
Parallel Algorithms for Testing if a Point is Inside a Closed Curve,
PRL(12), 1991, pp. 73-77.
BibRef
9100
Hui, K.C.,
A Robust Point Inclusion Algorithm for Regions Bounded
by Parametric Curve Segments,
CAD(29), No. 11, November 1997, pp. 771-778.
9712
BibRef
Cheung, C.K.[Chui Kwan],
Shi, W.Z.[Wen-Zhong],
Zhou, X.[Xian],
A Probability-based Uncertainty Model for Point-in-Polygon Analysis in
GIS,
GeoInfo(8), No. 1, March 2004, pp. 71-98.
WWW Version.
0401
BibRef
Meißner, M.,
Bartz, D.,
Müller, G.,
Hüttner, T.,
Einighammer, J.,
Generation of Decomposition Hierarchies for Efficient Occlusion Culling
of Large Polygonal Models,
VMV01(xx-yy).
PDF Version.
0209
BibRef
Chapter on 2-D Feature Analysis, Extraction and Representations, Shape, Skeletons, Texture continues in
Digital Geometry .