Fast Inpolygon in MEX 1.0

This is a C implementation of the great Matlab code provided by Darren Engwirda. You can find his code in:http://www.mathworks.com/matlabcentral/fil...in-polygon-test According to my estimates, it works more than 2x as fast. So far, this is one of the fastest implementation that I know of. Sorting is big step of this algorithm. To make it an exact replica, I use stable_sort of std library. Here is a sample call: tic(); [In2 On2]=inpolygon_fast(x, y, xv, yv); toc(); The call interface is similiar to inpolygon and not to inpoly. Here x and y are the points to check, where xv and yv define the polygon. The attachment includes the cpp file, a sample function for comparison and Darren's code.

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Check,  Comparison,  Define,  Dinpolygon Fastx,  Inpoly,  Inpolygon,  Interface,  Points,  Similiar
Users rating:	0/10