provide algorithm to determine whether a point is inside the polyhedron

Will be used in BornAgain, bornagain#353.

There exist well known, simple and elegant algorithms.

For reference, the 2D case:

• https://en.wikipedia.org/wiki/Point_in_polygon

The 3D case:

• Simply shooting rays, https://www.codefull.net/2016/03/cgal-point-in-polyhedron-algorithm
• Lane et al 1984, https://www.sciencedirect.com/science/article/abs/pii/0734189X84901336
• Said & Parker 1996, https://www.geog.leeds.ac.uk/groups/geocomp/1996/abs081.htm

Using oriented solid angle:

• Jakobson et al, 2013, https://dl.acm.org/doi/10.1145/2461912.2461916
• Barill et al 2018, https://dl.acm.org/doi/pdf/10.1145/3197517.3201337?casa_token=RlUhwB_qh3YAAAAA:4fpJScGb5irbvnXAVQ0J83Jt4Z0JTPd17o2rv0dUoCQdrwEs_M_-72D50pBtWfYfKugC-oslDpvY