| 摘要 |
Systems, methods, and other embodiments associated with determining whether a point is located in a polyhedron are described. One example method includes identifying a ray that connects a query point to a second point located outside a minimum bounding volume of a solid polyhedron without intersecting a vertex of the solid polyhedron. The method includes counting crossings of planar faces of the solid polyhedron by the ray. The crossings may be mid-face crossings, edge crossings, and/or coplanar crossings. The crossings are selectively counted based on whether the ray actually crosses a face, grazes a face without crossing it, or runs coplanar with a face without crossing another face. The method includes controlling an automated process based on whether first point is inside the solid polyhedron.
|
