Determining the Spatial Containment of a Point in General Polyhedra,
CGIP(19), No. 4, August 1982, pp. 303-334.
WWW Link. BibRef 8208
A Theorem to Determine the Spatial Containment of a Point in a Planar Polyhedron,
CVGIP(45), No. 1, January 1989, pp. 106-116.
WWW Link. BibRef 8901
An Efficient Point in Polyhedron Algorithm,
CVGIP(26), No. 1, April 1984, pp. 118-125.
WWW Link. BibRef 8404
Parallel Algorithms for Testing if a Point is Inside a Closed Curve,
PRL(12), 1991, pp. 73-77. BibRef 9100
Method of detecting an internal point within a closed area,
US_Patent5,014,331, May 7, 1991
WWW Link. BibRef 9105
A Robust Point Inclusion Algorithm for Regions Bounded by Parametric Curve Segments,
CAD(29), No. 11, November 1997, pp. 771-778. 9712
Cheung, C.K.[Chui Kwan],
A Probability-based Uncertainty Model for Point-in-Polygon Analysis in GIS,
GeoInfo(8), No. 1, March 2004, pp. 71-98.
DOI Link 0401
Rueda, A.J.[Antonio J.],
Feito, F.R.[Francisco R.],
The multi-LREP decomposition of solids and its application to a point-in-polyhedron inclusion test,
VC(26), No. 11, November 2010, pp. 1361-1368.
WWW Link. 1101
Point Containment in Discrete Arbitrary Dimension,
IEEE DOI 0606
Determine whether a point is inside a boundary. BibRef
Generation of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models,
PDF File. 0209
Chapter on 2-D Feature Analysis, Extraction and Representations, Shape, Skeletons, Texture continues in
Digital Geometry .