Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!samsung!uunet!mcsun!hp4nl!charon!tromp
From: tromp@cwi.nl (John Tromp)
Newsgroups: comp.graphics
Subject: fill algorithms and memory usage
Summary: (flood) fill algorithms: how much (non-bitmap) space do they use?
Keywords: flood fill, memory usage
Message-ID: <2470@charon.cwi.nl>
Date: 2 Nov 90 17:23:09 GMT
Sender: news@cwi.nl
Lines: 8

I am investigating algorithms for filling up an arbitrary enclosed region
in a bitmap. I already traced some references, but the algorithms i found
are concerned with speed mainly, e.g. number of times each internal pixel
gets visited. Instead I am interested in algorithms using as little memory
as possible. Can anybody tell me what is known about this or provide me
with pointers? Many thanks,

John Tromp (tromp@cwi.nl)