> Van: [email protected] [mailto:programming- > [email protected]] Namens Boyko Bantchev > Onderwerp: Re: [Jprogramming] Polygon containment > > On 21 April 2010 12:56, R.E. Boss <[email protected]> wrote: > > (...) > > I estimate that this solution performs better than others. > > Better than what? Measured on what? I find your statement doubtful > in view of the complexity of the above mentioned numeric operations > that it is based upon (apart from them making the method less stable).
With "performs better than others" I meant that the winding number method would deliver Bron an answer for his gazillion points in less time than my verb pip or your verb pinp. (...) > > > Apart from that it works for a large(r) collection of polygons. > > ‘Works’ would depend on how you would want to treat islands – > polygons entirely within polygons, and islands' islands etc. > Are they holes (and holes within holes) or are they just internal > areas – preferences vary. Similar for intersecting polygons. I meant that the winding number method also works on concave polygons, what my pip does not, and I expect that it works on more/stranger polygons than your pinp. I do not consider a polygon inside a polygon as one polygon, assuming I understand you remark correctly. R.E. Boss ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
