Fast Inpolygon in MEX

Fast inpolygon function implemented in MEX. So far one of the fastest.

Description

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/fileexchange/10391-fast-points-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.

• Required Products: Image Processing Toolbox
• MATLAB release: MATLAB 7.9 (2009b)

[Bruno Luong]

According to my test, fastest in_polygon is not this submission but this one:

http://www.mathworks.com/matlabcentral/fileexchange/27840-2d-polygon-interior-detection

The CPP mex file (not C) lacks help, document on calling convention, and error checking. I get few crashes when playing around with it.

[Tolga Birdal]

You are right. Good to know.
Actually there is help and calling convention in the above documentation and I provided a sample file as well.
Error checking is not done for speed reasons (your code also lacks that in some sense).

[Alex Franquet]

 

[Yaver Kamer]

So now that you know that this code is not the fastest would you kindly consider editing your bold claims just for the sake of not being misleading?