Is there something that creates bitmaps? So say I wanted to make a bitmap of the Mandelbrot set (and I had a 2d array representing each pixel) is there a verb that will make that into a bitmap?
___________________________ David Vaughan On 7 Nov 2011, at 19:25, Raul Miller <[email protected]> wrote: > Sometimes your description seems accurate. > > However, consider: > viewmat i.10 > or > viewmat 2 > > -- > Raul > > On Mon, Nov 7, 2011 at 1:36 PM, David Vaughan > <[email protected]> wrote: >> Am I right in thinking that viewmat takes a 2d array and treats it as if >> each number is a pixel and its value is its colour? >> Thanks. >> >> ___________________________ >> >> David Vaughan >> >> On 6 Nov 2011, at 20:12, "Linda Alvord" <[email protected]> wrote: >> >>> Here's another option: >>> >>> S=: 13 :'''+.''{~([:+./*.)"1/~#:i.y' >>> S >>> '+.' {~ [: ([: +./ *.)"1/~ [: #: i. >>> >>> S 8 >>> ++++++++ >>> +.+.+.+. >>> ++..++.. >>> +...+... >>> ++++.... >>> +.+..... >>> ++...... >>> +....... >>> >>> Linda >>> >>> >>> >>> >>> >>> >>> >>> >>> >>> -----Original Message----- >>> From: [email protected] >>> [mailto:[email protected]] On Behalf Of Roger Hui >>> Sent: Saturday, November 05, 2011 2:10 PM >>> To: Programming forum >>> Subject: Re: [Jprogramming] Binary Addresses Method >>> >>> I believe the "and" in your pseudocode maps to 17 b. (bitwise and). Thus: >>> 0 = 17 b./~ i.256 >>> >>> For example, using the boolean matrix result to index into '.*', >>> >>> '.*' {~ 0 = 17 b./~ i.16 >>> **************** >>> *.*.*.*.*.*.*.*. >>> **..**..**..**.. >>> *...*...*...*... >>> ****....****.... >>> *.*.....*.*..... >>> **......**...... >>> *.......*....... >>> ********........ >>> *.*.*.*......... >>> **..**.......... >>> *...*........... >>> ****............ >>> *.*............. >>> **.............. >>> *............... >>> >>> >>> >>> On Sat, Nov 5, 2011 at 10:50 AM, mikel paternain >>> <[email protected]>wrote: >>> >>>> >>>> >>>> >>>> In the amazing book Chaos and Fractals New frontiers of Science, the >>>> authors described a simple algorithm for making the Sierpinski Gasket. >>> This >>>> is perhaps the most short and efficient algorithm (in non tacit >>> programming >>>> languages) for computing this fractal. >>>> The basic algorithm is(in pseudocode): >>>> >>>> Define x,y >>>> For y=0 to 255 >>>> For x=0 to 255 >>>> If /x And y)=0 Then Pset(x,y) //Pset is a function for drawing >>>> the point x,y >>>> Next x >>>> Next y >>>> End >>>> >>>> With my little experience inJ the question is how translate this code to J >>>> . Help me please! >>>> Thanks in advance!! >>>> >>>> Mikel >>>> ---------------------------------------------------------------------- >>>> For information about J forums see http://www.jsoftware.com/forums.htm >>>> >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >>> >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm >> > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
