Re: gEDA-user: Polygon combiner plugin

2010-06-07 Thread Armin Faltl
Peter Clifton wrote: The plugin now works to construct a tree ordered by containership - and processes the relevant contours in an appropriate order so outer contours are processed before inner ones. How do you determine containership? Tanks in advance

Re: gEDA-user: Polygon combiner plugin

2010-06-07 Thread Peter Clifton
On Mon, 2010-06-07 at 11:21 +0200, Armin Faltl wrote: Peter Clifton wrote: The plugin now works to construct a tree ordered by containership - and processes the relevant contours in an appropriate order so outer contours are processed before inner ones. How do you determine

Re: gEDA-user: Polygon combiner plugin

2010-06-07 Thread Peter Clifton
On Mon, 2010-06-07 at 12:02 +0100, Peter Clifton wrote: The inside / outside testing in poly_InsideContour() works by casting a ray in a particular direction from the point being outwards, and __ being tested counting intersections

Re: gEDA-user: Polygon combiner plugin

2010-06-07 Thread Armin Faltl
The answer was enlightening, though I'd have to do a lot more thinking about why it doesn't matter, if some polygons are intersecting. If a polygone is complex, i.e. has holes, the cast ray will pass an odd number of edges, if the start point is inside the polygon. Numerically difficult is the

Re: gEDA-user: Polygon combiner plugin

2010-06-07 Thread Peter Clifton
On Mon, 2010-06-07 at 14:37 +0200, Armin Faltl wrote: The answer was enlightening, though I'd have to do a lot more thinking about why it doesn't matter, if some polygons are intersecting. Not necessarily that the result doesn't matter, rather - that the correct result is not so easily defined