[
Date Prev][
Date Next][
Thread Prev][
Thread Next][
Date Index][
Thread Index]
[
List Home]
Re: [jts-dev] point-in-polygon algorithm using voronoi & point nearest-neighbor
|
I worked my way into this algorithm by thinking... if I could represent a polygon by a series of points such that I only need to find the nearest point to a query point (to test is it "inside" or not), then how might I do this? And I imagined, opposite each side of an edge/line of the polygon an opposing point equi-distant such that the edge/line completely divides the space between the points. As I did this on some paper, it occurred to me that I was building something much like a Voronoi diagram, at least it looked like one. Maybe it isn't completely.
I think you'd need a LINE Voronoi of the polygon - which is much harder to compute than the point Voronoi (harder = code complexity, robustness).
But I may be missing something - I don't understand what are the "points opposing each side".
_______________________________________________
jts-dev mailing list
jts-dev@xxxxxxxxxxxxxxxx
To change your delivery options, retrieve your password, or unsubscribe from this list, visit
https://www.locationtech.org/mailman/listinfo/jts-dev
--
Lucene/Solr Search Committer, Consultant, Developer, Author, Speaker