Deutsch English Français Italiano |
<867chlk1zf.fsf@linuxsc.com> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder6.news.weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch <tr.17687@z991.linuxsc.com> Newsgroups: comp.lang.c Subject: Re: filling area by color atack safety Date: Thu, 28 Mar 2024 23:04:36 -0700 Organization: A noiseless patient Spider Lines: 21 Message-ID: <867chlk1zf.fsf@linuxsc.com> References: <ut3669$21eur$1@i2pn2.org> <86h6h3nvyz.fsf@linuxsc.com> <865xxiok09.fsf@linuxsc.com> <20240319131842.00002138@yahoo.com> <utbuk3$qed7$1@dont-email.me> <20240319191859.00004bc8@yahoo.com> <86bk79m10l.fsf@linuxsc.com> <20240324202758.00001b75@yahoo.com> <86frwfjs0n.fsf@linuxsc.com> <20240325012844.0000685b@yahoo.com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Date: Fri, 29 Mar 2024 06:04:39 +0100 (CET) Injection-Info: dont-email.me; posting-host="5dfda3fb31f95cd0acc189d3147c50da"; logging-data="152810"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/Pht2Sxln0WV+r+sK1ynMMJEUPyEh9y34=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:T5IOmxzAt968XRhQ4UzoLHDAFEM= sha1:muzLQXD+PwJyGIA1P/ymIHm2HjQ= Bytes: 2158 Michael S <already5chosen@yahoo.com> writes: >> [..various fill algorithms and how they scale..] > > One thing that I were not expecting at this bigger pictures, is good > performance of simple recursive algorithm. Of course, not of original > form of it, but of variation with explicit stack. > For many shapes it has quite large memory footprint and despite that it > is not slow. Probably the stack has very good locality of reference. > > [algorithm] You are indeed a very clever fellow. I'm impressed. Intrigued by your idea, I wrote something along the same lines, only shorter and (at least for me) a little easier to grok. If someone is interested I can post it. I see you have also done a revised algorithm based on the same idea, but more elaborate (to save on runtime footprint?). Still working on formulating a response to that one...