mk@infocon.se (Magnus Karlson) (11/01/88)
This has probably been asked several times before but please execuse me for asking again and again... If I have a set of cordinate pairs defining a closed polygon which is the fastest possible algoritm to fill this area hoppfully without using floating point (the cordinate pairs are integers). I willingly accept answers ranging from undocumented C source to references in good books. I anyone is interested I can summerize any answers to the net. Magnus Karlson infocon data ab UUCP: uunet!mcvax!enea!infocon!mk or mk@infocon.se