How to fastest check if point (3D) is inside convex hull given by set of point?

Assuming P is large and there are many p0, you should compute a 3D triangulation in which to do point location. This is a CGAL demo .

You can write down the points in the hull as columns in a matrix and then have a vector which tells you what combination of points to take.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.