did last week:
gave up once again on CoRgi. So I thought a lot about 2D
selection and made some pretty drawings and came up with
all these ideas about how to disect an arbitrary shape.
In principle I decided to deal with line-segments that
make up a closed curve. I wanted to allow intersecting
curves, so that complicated things quite considerably.
When the shape is purely concave there is no problem, as
one can adopt a bisection-approach in 2D, but I cannot
assume such simplifications. So then after a lot of
thinking I woke up at 6:30 in the morning (pretty amazing
as such) and suddenly had this idea of counting the
numbers of crossings with the outter contour of the
shape: Any point inside crosses the boundary an odd
number of times, any point outside crosses an even number
of times (if at all, but 0 is also even). Details
are as always on the worksofar pages.