Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!news-out.readnews.com!news-xxxfer.readnews.com!panix!not-for-mail From: JohnF Newsgroups: comp.graphics.algorithms Subject: Re: decorative random colors algorithm Date: Wed, 4 Jul 2012 10:59:28 +0000 (UTC) Organization: PANIX Public Access Internet and UNIX, NYC Lines: 22 Message-ID: References: <5c2486fa-f347-4268-a34e-8eec3b5b8394@googlegroups.com> NNTP-Posting-Host: panix3.panix.com X-Trace: reader1.panix.com 1341399568 16969 166.84.1.3 (4 Jul 2012 10:59:28 GMT) X-Complaints-To: abuse@panix.com NNTP-Posting-Date: Wed, 4 Jul 2012 10:59:28 +0000 (UTC) User-Agent: tin/2.0.0-20110823 ("Ardenistiel") (UNIX) (NetBSD/5.1.2 (i386)) Xref: csiph.com comp.graphics.algorithms:919 JohnF wrote: > gernot.hoffmann@hs-emden-leer.de wrote: >> 2) Render twice. First pass with e.g. 17 segments, second pass with >> 100 segments. The second pass interpolates as well, but with respect >> to an almost correct background. >> All my CIE-Diagrams are rendered twice. > > Okay, I'll put that on my to-do list. I think I can modify your code > myself to deal with an N1 and an N2. And I guess the constraint > is to pick them relatively prime, or something like that, so no two > boundaries coincide. Okay, that's done. The sample forkosh.com/decorative4.ps has been replaced, yet again, and also the forkosh.com/cgi-bin/lineart.cgi program. For the time being I've just set N2=N1+7, which will probably have few, and usually no, coinciding boundaries. So that should now look okay on acrobat (it looks identical on gv to me). I'll eventually probably choose N2 = first prime number > N1, or something like that (haven't really thought that through yet). -- John Forkosh ( mailto: j@f.com where j=john and f=forkosh )