[b]2. Proposition: [/b][i]Given a list of vertices, and a set of segments defined as the closed path joining the elements of the list, in order, to determine the points of intersection among the segments.[/i]
In other words, to find the points of self-intersection of a Polygon object.
(I will make a (set of?) tool(s) when I have a clearer idea of what information will be useful to carry forward.)
___________
I have now gathered what I need. I can at last set up the larger problem: to disambiguate a given vertex list into a distinct (union of) polygonal region(s).
Onward.
