Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.graphics.algorithms > #918
| From | JohnF <john@please.see.sig.for.email.com> |
|---|---|
| Newsgroups | comp.graphics.algorithms |
| Subject | Re: decorative random colors algorithm |
| Date | 2012-07-04 09:51 +0000 |
| Organization | PANIX Public Access Internet and UNIX, NYC |
| Message-ID | <jt13me$le3$1@reader1.panix.com> (permalink) |
| References | <jspf0f$moq$1@reader1.panix.com> <5c2486fa-f347-4268-a34e-8eec3b5b8394@googlegroups.com> |
gernot.hoffmann@hs-emden-leer.de wrote: > Reply for July 4, 2012: > > your decorative graphic looks really nice, congratulations! I hope you looked (literally) just now, because the originally uploaded version was mistakenly using different random l,s values for each line (I'd flipped an if/then/else clause). It's now fixed, and the sample's using constant l=0.5, s=1.0. And I've added a %comment after each setrgb showing the corresponding h,l,s values, just to be sure. The correct sample graphic now replaces the original erroneous one, at forkosh.com/decorative4.ps and now shows a nice color fan as expected. And, of course, the online cgi is corrected and replaced, too. Sorry about that. > Using stepwise rendering instead of smooth shading, which requires > PostScript 3, has one disadvantage: > Do you observe in Acrobat thin white lines between the segments? Actually, I've just been using gv, which shows your stepwise rendering quite nicely. I'll have to try acrobat when I get to a box that has it. > These are artefacts created by Acrobat, trying to interpolate a segment > boundary with respect to a white background. Two solutions: > 1) Uncheck 'Smooth lineart' in Acrobat. But then the whole image looks > pixelated. > 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. > If you've nothing else to do, you may have a look here: > http://www.fho-emden.de/~hoffmann/casamunsell24062012.pdf Excellent. You can never be too rich, or too thin, or have too many pictures of public toilets. Actually, your "rosetta stone" german/english page gave me an opportunity to try to remember my one year of college german (and three of french). I've spent several months in france, so have whatever french I know fairly permanently imprinted. But only a few days in germany, so couldn't even remember how to ask where to find ... the public toilet (now I can just point to the picture). > Best regards -- Gernot Hoffmann Ditto, thanks so much. -- John Forkosh ( mailto: j@f.com where j=john and f=forkosh )
Back to comp.graphics.algorithms | Previous | Next — Previous in thread | Next in thread | Find similar
decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-01 12:15 +0000
Re: decorative random colors algorithm gernot.hoffmann@hs-emden-leer.de - 2012-07-01 07:59 -0700
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-02 07:58 +0000
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-02 12:29 +0000
Re: decorative random colors algorithm Nobody <nobody@nowhere.com> - 2012-07-01 16:25 +0100
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-02 08:28 +0000
Re: decorative random colors algorithm gernot.hoffmann@hs-emden-leer.de - 2012-07-03 01:17 -0700
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-03 10:27 +0000
Re: decorative random colors algorithm gernot.hoffmann@hs-emden-leer.de - 2012-07-03 21:50 -0700
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-04 05:15 +0000
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-04 08:01 +0000
Re: decorative random colors algorithm gernot.hoffmann@hs-emden-leer.de - 2012-07-04 02:20 -0700
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-04 09:51 +0000
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-04 10:59 +0000
Re: decorative random colors algorithm Wally W. <ww84wa@aim.com> - 2012-07-04 09:03 -0400
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-04 13:46 +0000
Re: decorative random colors algorithm Wally W. <ww84wa@aim.com> - 2012-07-04 12:39 -0400
Re: decorative random colors algorithm gernot.hoffmann@hs-emden-leer.de - 2012-07-04 07:10 -0700
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-04 15:05 +0000
Re: decorative random colors algorithm gernot.hoffmann@hs-emden-leer.de - 2012-07-04 09:12 -0700
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-05 03:18 +0000
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-05 05:54 +0000
Re: decorative random colors algorithm John Forkosh <forkosh@panix.com> - 2012-07-05 12:23 +0000
Re: decorative random colors algorithm "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2012-07-05 07:48 +0200
Re: decorative random colors algorithm JohnF <john@please.see.sig.for.email.com> - 2012-07-05 06:14 +0000
Re: decorative random colors algorithm Wally W. <ww84wa@aim.com> - 2012-07-05 07:30 -0400
csiph-web