I'm trying to make my set operations work over polygons with self-intersections. It's has been a hard work, cause I lost a lot of tricks/assumptions used in my old algorithms.
It's possible to make it using pixel combinations among the drawn polygons and after making some kind of bitmap vectorization, but I don't want it. I want to make it just by euclidean geometry.
I'm making my model, my algorithm ... Sometimes it's hard even to make tests. Let's play a little bit more.
PS: image was drawn using Windows GDI.
No comments:
Post a Comment