I have a KML file which contains many latitudes/longitudes which
around 500 odd polygons (approx 6,000 points are present).
I also have a sample file which contains
latitude and longitude for the entire area of say a particular
(approx 10 million odd points latitude/longitude)
I have been going around Lucene Spatial
documentation from some time but I am unable to understand if it will
serve the following purpose:
a. To find for each point whether it lies inside some polygon or
(effectively a point can be either inside or outside all of the
polygons) with close to 100% accuracy.
As of now, I have achieved this usecase by
implementing RayCrossing algorithm in Java
I am inclined to use Lucene
as I am already using it for number of other usecases. Additionally
RayCrossing algorithm is slow for such a huge number of points.
Please advise. Please point to some code samples which can get me
started on achieving the usecase if it's possible using Lucene.