Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

  • Vaclav Skala
  • January 2016, American Institute of Physics
  • DOI: 10.1063/1.4952270

The authors haven't finished explaining this publication. If you are the author, sign in to claim or explain your work.

Read Publication


The following have contributed to this page: Prof. Vaclav Skala