Combine polygons...
-
Hello, Sorry Chris, please let me break the rule :( I quickly need a good algorithm (and code if possible) to combine two polygons. The algorithm must take care of the rotation of the polygons. Any pointer to related website/libraries or even books are welcomed. Regards, Paul. Paul Selormey, Bsc (Elect Eng), MSc (Mobile Communication) is currently Windows open source developer in Japan, and open for day job or programming contract anywhere!
-
Hello, Sorry Chris, please let me break the rule :( I quickly need a good algorithm (and code if possible) to combine two polygons. The algorithm must take care of the rotation of the polygons. Any pointer to related website/libraries or even books are welcomed. Regards, Paul. Paul Selormey, Bsc (Elect Eng), MSc (Mobile Communication) is currently Windows open source developer in Japan, and open for day job or programming contract anywhere!
How are your polygons setup? Dou you use vertex and edge lists? Josh josh@schroff.com
-
Hello, Sorry Chris, please let me break the rule :( I quickly need a good algorithm (and code if possible) to combine two polygons. The algorithm must take care of the rotation of the polygons. Any pointer to related website/libraries or even books are welcomed. Regards, Paul. Paul Selormey, Bsc (Elect Eng), MSc (Mobile Communication) is currently Windows open source developer in Japan, and open for day job or programming contract anywhere!
You might try Murta´s General Polygon Clipping library, which does unions intersections clipping, etc... I havent done much with it yet, but the code looks well written (at a glance) so it might be worth a serious look. You can find it at... http://www.cs.man.ac.uk/~amurta/software/index.html#gpc Dave Carkeet NCL Santiago, Chile
-
How are your polygons setup? Dou you use vertex and edge lists? Josh josh@schroff.com
Hello Josh, Thanks for the response. I have the vertex list of the polygons. Any tip? Regards, Paul. Paul Selormey, Bsc (Elect Eng), MSc (Mobile Communication) is currently Windows open source developer in Japan, and open for day job or programming contract anywhere!
-
You might try Murta´s General Polygon Clipping library, which does unions intersections clipping, etc... I havent done much with it yet, but the code looks well written (at a glance) so it might be worth a serious look. You can find it at... http://www.cs.man.ac.uk/~amurta/software/index.html#gpc Dave Carkeet NCL Santiago, Chile
Hello, Thanks so much for the help. It looks cool and I am currently trying it. Regards, Paul. Paul Selormey, Bsc (Elect Eng), MSc (Mobile Communication) is currently Windows open source developer in Japan, and open for day job or programming contract anywhere!