Efficiently check if points are contained in polygons

[juliohm]

Update regarding the Meshes.jl comments above. It now has a very efficient multi-threaded algorithm for point in polygon by Hao et al:

[ANN] Meshes.jl - Computational Geometry in Julia

Quick updates: Addition of Wedge geometry as a 3-Polytope Discretization of Cylinder into Hexahedron and Wedge geometries [image] New sideof(point, ring) and point ∈ poly with Hao et al. algorithm, which we implemented with multiple-threads. Speedup of ~12x. The algorithm is quite robust, and can handle all sorts of degenerate cases in 2D polygonal areas: [image] Angles with explicit rad units: julia> ∠(Vec(1, 0), Vec(0, 1)) 1.5707963267948966 rad Addition of various CRS for geo…