Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!pasteur!ames!lll-winken!uunet!mcvax!kth!draken!tut!santra!kampi!jmunkki
From: jmunkki@kampi.hut.fi (Juri Munkki)
Newsgroups: comp.graphics
Subject: Re: Looking for simple fill algorithm
Message-ID: <21581@santra.UUCP>
Date: 25 Apr 89 20:41:35 GMT
References: <4344@tekgen.BV.TEK.COM> <4295@pixar.UUCP>
Sender: news@santra.UUCP
Reply-To: jmunkki@kampi.hut.fi (Juri Munkki)
Organization: Helsinki University of Technology, Finland
Lines: 24

In article <4295@pixar.UUCP> fishkin@pixar.UUCP (Ken Fishkin) writes:
>Seems I send this out every few months.
>    The fill algorithms alluded to are extremely ineffecient.

Thanks, but...

	I think the original poster said that he wanted to fill the
	area inside a postscript path. He already had a set of
	lines so what he wanted was a polygon fill. I've never
	understood why people would want fast flood-fills.

	I also seem to remember that the poster wanted source code.

On another matter:

	I don't think I want to see another public domain ray
	tracer until someone creates a good public domain solid
	modeling package. What's the use of calculating the same
	scenes over and over again? 

_._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._
|     Juri Munkki jmunkki@hut.fi  jmunkki@fingate.bitnet        I Want   Ne   |
|     Helsinki University of Technology Computing Centre        My Own   XT   |
^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^