Hi, I hate to post such an abstract question here, but I'm at a loss as for where to start.

I basically want some info, source and/or suggestions on how I go about filling (quickly) some 2d ploygons defined by a list of the vertices.

All I know about this topic is that there are a couple of types of polygons, like complex and simple ones. I don't mind limiting myself to the simple type i.e a line drawn between any two vertices will never cross an edge. Basically any help at all is appreciated as I need a place to start.

BTW I'll be drawing to a DIB backbuffer so GDI routines probably won't be helpful (unless only simple ones are used as I can replicate them myself)

Thanks in advance
Posted on 2001-07-30 15:16:37 by Eóin
Sutherland-Hodgman algorithm is what you want to search for.

Polygon Fill Teaching Tool especially look at the Resources Page
Posted on 2001-07-30 15:48:36 by bitRAKE
Thanks bitRAKE, that link had all the info I needed.
Posted on 2001-07-31 06:17:27 by Eóin