Path: utzoo!attcan!uunet!mcvax!enea!infocon!mk
From: mk@infocon.se (Magnus Karlson)
Newsgroups: comp.graphics
Subject: Fast vector based fill algoritm
Message-ID: <344@infocon.se>
Date: 10 Nov 88 20:13:01 GMT
Organization: infocon data ab, Sollentuna, Sweden
Lines: 19

In article <342@infocon.se> mk@infocon.se (Magnus Karlson) I asked:

|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 forgot to add that the output should go to a plotter and we don't
have room in memory to first make a normal pixel fill and then convert
to vectors. So pleace if someone have a better(faster) algoritm then
the only one we have found in the book Computer Graphics by Hearn & Baker
p 83-90.

	Magnus Karlson    mk@infocon.se