Hi Luke,
I wanted to ask Bruno and Barend to comment on whether they think this algorithm would be useful and solicit the boost community in general to comment on my progress designing the interfaces to it. I looked at Barend's library and could only find rectangle clipping, did I miss it, or is a comparable capability not provided by Barend's geometry library?
For now we're mostly busy with design questions, how to represent data, how the user integrates his own into the library, and adapting the library in that direction. Once this will be done, we'll see more clearly and be able to add any type of computation to the proposed set of algorithms. Your API based on tag dispatching looks good to me. Could you just be more precise on the polygon concepts? Which are the different valid expressions required by each of them? For now Barend's library doesn't use concepts to represent polygons but a provided class, due to the complexity of manipulating a polygon (compared to a linestring for example, that can be summarized by a mere pair of iterators). So I'm curious to see what could be a polygon concept... One other question: at the beginning your library was supposed to me limited to 90 and 45 degrees computations (if I understood well), but you're now talking about arbitrary angles. Has the scope of your library changed? Did I miss something? Regards Bruno