Inside/Outside Tests

Chapter Contents (Back)

Kalay, Y.E.[Yehuda E.],
Determining the Spatial Containment of a Point in General Polyhedra,
CGIP(19), No. 4, August 1982, pp. 303-334.
Elsevier DOI point in volume enclosing polyhedra. BibRef 8208

Horn, W.P.[William P.], Taylor, D.L.[Dean L.], 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.
Elsevier DOI Containment of a point within polyhedron of planar faces BibRef 8901

Lane, J.[Jeff], Magedson, B.[Bob], Rarick, M.[Mike],
An Efficient Point in Polyhedron Algorithm,
CVGIP(26), No. 1, April 1984, pp. 118-125.
Elsevier DOI Point on or in polyhedron boundary. 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

Kurogane, T.[Toshio], Nagaoka, D.[Daiji],
Method of detecting an internal point within a closed area,
US_Patent5,014,331, May 7, 1991
WWW Link. BibRef 9105

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

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.
DOI Link 0401

Martínez, F.[Francisco], 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

Soukal, R.[Roman], Malková, M.[Martina], Kolingerová, I.[Ivana],
A New Visibility Walk Algorithm for Point Location in Planar Triangulation,
ISVC12(II: 736-745).
Springer DOI 1209
Finding where in the mesh the point occurs. BibRef

Silva, L.[Luciano],
Point Containment in Discrete Arbitrary Dimension,
Determine whether a point is inside a boundary. 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,
PDF File. 0209

Chapter on 2-D Feature Analysis, Extraction and Representations, Shape, Skeletons, Texture continues in
Digital Geometry .

Last update:May 6, 2024 at 15:50:14