![]() |
Fast Concave Polygon Filling Algorithm is wanted
I am looking for a fast concave polygon filling algorithm, which needs to be fast enough to run on mobiles or pdas.
the polygons normally contain hundreds of points and need to be painted regularly. Triangulation, scanline are not fast enough for me. anyone has good idea please reply this message or email me to jarlymail@yahoo.com thanks soo much |
my idea would be to try coding something and posting a question with code on here, and not a want ad
JD |
A want ad might be more appropriate here if that's what you're looking for ask a mod to move it for you.
What langauges/chipsets/technologies you working with? -MBirchmeier |
| All times are GMT -5. The time now is 8:55 AM. |
Powered by vBulletin® Version 3.7.0, Copyright ©2000 - 2008, Jelsoft Enterprises Ltd.
Copyright ©2007 DaniWeb® LLC