Publication not explained
This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.
If you are one of the authors, claim this publication so you can create a plain langauage summary to help more people find, understand and use it.
Read the Original
This page is a summary of: Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision, January 2016, American Institute of Physics, DOI: 10.1063/1.4952270.
You can read the full text:
The following have contributed to this page