Path: utzoo!mnetor!uunet!husc6!bloom-beacon!gatech!purdue!decwrl!ucbvax!ucsfcgl!pixar!unicom!daniel From: daniel@unicom.UUCP (Dan Smith, not your average Lithuanian...) Newsgroups: comp.graphics Subject: Re: FAST flood fill Message-ID: <337@unicom.UUCP> Date: 7 May 88 01:48:05 GMT References: <1210@sbcs.sunysb.edu> <23807@ucbvax.BERKELEY.EDU> <288@nccnat.UUCP> Reply-To: daniel@unicom.UUCP (Dan Smith, not your average Lithuanian...) Organization: Science Computer Center, MCC, Kentfield, CA Lines: 21 In article <288@nccnat.UUCP> shields@yunccn.UUCP writes: >There's a paper kicking around somewhere by someone at Berkeley, circa 1986, >analyzing all previously known fill algorithms and presenting a new one. > >A friend of mine at IBM has optimized this alogorithm, achieving high- >performance fills for multiply-connected regions: > - worst case 1.5 visits per pel; > - best case 1.0 vists per pel; > - avg = 1.05. >Source is about 25-30 lines of C, plus 50-60 lines of supporting code. > post it, don't tease us :-) dan dan smith, island graphics, marin co, ca, good natured infonaut, hoopy frood 4000 civic center dr., san rafael 94903 | dis: they're My thoughts, Buckwheat! uucp: {ucbvax!ucbcad,sun}!island!daniel | ph: +1 (415) 491 1000 (W), 332 FAST, uucp: {pacbell,pixar}!unicom!daniel | 332 EASY (H)| unix/films/rock/feasts