Determining the spatial containment of a point in general polyhedra

DOI10.1016/0146-664X(82)90019-3zbMath0531.68026OpenAlexW2051650914MaRDI QIDQ3313277

Yehuda E. Kalay

Publication date: 1982

Published in: Computer Graphics and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0146-664x(82)90019-3

zbMATH Keywords

shapesprojection methodparallel projectionintersection method3D point- polyhedron containment analysisinclusion of a point in volume-enclosing polyhedra

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

A fast boundary integral equation method for point location problem ⋮ An efficient algorithm to generate random sphere packs in arbitrary domains

This page was built for publication: Determining the spatial containment of a point in general polyhedra