Hello,
I have written a draft of my GSoC as well as the public and private applications. I am aiming to do the "Implement Boolean Operations on Polygons" project. Could I have some suggestions to improve it? link to proposal (I have submitted on GSoC website as well if that's easier)
-Alex P
Lots of formatting to make it easier to read. I realize the GSoC gives a bulleted list of what needs to be in there, but just inserting information into this list makes it very difficult to read.
Just a nitpick about your background research of GPC, but GPC may be a little bit slower than Clipper and Boost (though much of that can be sped up with point sorting), but based on my past experience it is by far the most robust and commercially used polygon library on the planet. In fact, GPC has worked in many scenarios I have encountered with self-intersections and complex polygons that all the other solutions mess up very badly. All that being said, GPC is not an option anyways because of its non-OpenSource-compatible licensing.
Let me know once you have your proposal in a more narrative format telling me the story of what you are going to do, why it is important, and why you are the right person to tackle it and I will take another look.
John S. |