Efficient algorithms for testing membership of a point in polygons and polyhedra
From MaRDI portal
Publication:1325999
zbMath0807.68038MaRDI QIDQ1325999
Publication date: 12 July 1994
Published in: Programming and Computer Software (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
This page was built for publication: Efficient algorithms for testing membership of a point in polygons and polyhedra