Really like these. The random-walk aspect is similar to work I was doing in basic with quasi-fractal paths; check out the .bas (especially the drawalk) materials at the website under .bas, if you have access to qbasic. I'm not sure, but I could put qbasic itself up; it's a small program.
These are so elegant!
I couldn't get the second URL to work btw - Alan
On Fri, 15 Apr 2005 [EMAIL PROTECTED] wrote:
http://noemata.net/drawm
http://noemata.net/noscape
-
other sketches to simple drawing machines (markov-chain)
1) requires a small table of 8 positions with corresponding frequency [option colour]. simple abstract patterns? eg. general direction of lines will reproduce. add bouncing when hitting frame border (inverse directions).
//input scan source drawing(s) for each pixel for each 8 neighbour position if pixel add statistics frequency [colour]
//output pixel start at middle/random pos while pixel inside frame move to and set neighour pos according to statistics
2) another would be mapping each pixel pos (x1,y1) to 8 neighbour pos (x2,y2). this will reproduce actual patterns and diverge at line- crossings.
3) adding to 1) one could store n more adjacent neighours to 8^n size of table, 5 level adjacents gives 32k records i table. experiment with levels to find what suits the source drawings. too many levels give meager output or just reproduces the original, a diffuse where the patterns emerge, too little levels and you're back to abstract chaos.
__
isbn 82-92428-10-0
http://www.asondheim.org/ nettext at http://biblioteknett.no/alias/HJEMMESIDE/bjornmag/nettext/ WVU 2004 projects: http://www.as.wvu.edu/clcold/sondheim/ partial backup at http://www.as.wvu.edu:8000/clc/Members/sondheim Trace projects at http://trace.ntu.ac.uk/writers/sondheim/index.htm Books: Vel (Blazevox) The Wayward (Vox) Sophia (Writers Forum) .echo (Alt-X)
