Timeline for Generate a mandelbrot fractal [closed]
Current License: CC BY-SA 3.0
53 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2017 at 0:11 | history | edited | totallyhuman | CC BY-SA 3.0 |
edited title
|
| Oct 30, 2017 at 0:04 | history | edited | 0 ' | CC BY-SA 3.0 |
Made the definition of the sequence and boundedness requirements for the challenge clearer
|
| Oct 29, 2017 at 22:29 | review | Reopen votes | |||
| Oct 30, 2017 at 1:20 | |||||
| Jul 17, 2017 at 23:27 | comment | added | Jerry Jeremiah | Too bad it's closed. There is a good answer here: lang5.sourceforge.net/tiki-index.php?page=About | |
| May 27, 2017 at 7:07 | history | closed |
Wheat Wizard♦ Riker user62131 user45941 Laikoni |
Needs details or clarity | |
| May 27, 2017 at 1:01 | review | Close votes | |||
| May 27, 2017 at 7:07 | |||||
| May 27, 2017 at 0:17 | answer | added | MD XF | timeline score: 0 | |
| May 26, 2017 at 23:24 | answer | added | MD XF | timeline score: 0 | |
| May 26, 2017 at 22:09 | answer | added | MD XF | timeline score: 2 | |
| Jan 12, 2017 at 0:25 | answer | added | James Holderness | timeline score: 1 | |
| Sep 15, 2016 at 12:35 | answer | added | Sok | timeline score: 0 | |
| Oct 25, 2015 at 21:31 | answer | added | flawr | timeline score: 1 | |
| Oct 25, 2015 at 15:10 | answer | added | lynn | timeline score: 1 | |
| Oct 25, 2015 at 10:24 | answer | added | user19214 | timeline score: 11 | |
| Oct 25, 2015 at 3:33 | answer | added | El'endia Starman | timeline score: 0 | |
| Oct 24, 2015 at 23:43 | answer | added | ZXDunny | timeline score: 3 | |
| Apr 19, 2014 at 13:49 | comment | added | gniourf_gniourf | The complex number z lies in the Mandelbrot set if the sequence (u(n)) defined by u(0)=0 and u(n+1)=u(n)^2+z is bounded. Your definition of the M-set is wrong. | |
| Apr 18, 2014 at 18:34 | answer | added | Digital Trauma | timeline score: 1 | |
| Mar 15, 2014 at 15:26 | answer | added | kitcar2000 | timeline score: 1 | |
| Mar 11, 2014 at 8:43 | answer | added | Marquis de Geek | timeline score: 25 | |
| Mar 9, 2014 at 22:24 | comment | added | fredtantini | Cause I won't take credit: mostlymaths.net/2014/01/… | |
| Feb 13, 2014 at 0:16 | answer | added | Ali Caglayan | timeline score: 4 | |
| Mar 10, 2013 at 16:22 | answer | added | AMK | timeline score: 1 | |
| Mar 8, 2013 at 14:31 | comment | added | aditsu quit because SE is EVIL | @dmckee a good way to parameterize the Mandelbrot fractal is to change it to a Julia fractal :) It's the same algorithm z = z^2 + c except for Julia c is given as input and z0 is the point we are checking | |
| Mar 8, 2013 at 0:12 | answer | added | aditsu quit because SE is EVIL | timeline score: 1 | |
| Mar 7, 2013 at 21:51 | answer | added | dmckee --- ex-moderator kitten | timeline score: 1 | |
| Mar 6, 2013 at 15:07 | answer | added | chyanog | timeline score: 6 | |
| Jun 16, 2012 at 21:50 | answer | added | agent-j | timeline score: 6 | |
| May 21, 2012 at 12:41 | vote | accept | Hannesh | ||
| Jan 14, 2012 at 18:19 | history | edited | Peter Taylor |
edited tags
|
|
| Nov 10, 2011 at 3:08 | answer | added | Anti Earth | timeline score: 0 | |
| Oct 23, 2011 at 22:32 | answer | added | ephemient | timeline score: 10 | |
| Oct 23, 2011 at 10:55 | answer | added | init | timeline score: 1 | |
| Oct 21, 2011 at 15:06 | answer | added | hammar | timeline score: 6 | |
| Oct 7, 2011 at 10:09 | comment | added | paulgreg | Have you seen that implementation in JavaScript in less than 140 bytes : jsfiddle.net/jP9Sa/10 ? | |
| Oct 3, 2011 at 10:28 | answer | added | PhiNotPi | timeline score: 5 | |
| Oct 1, 2011 at 11:54 | comment | added | DanBeale | Here's a source code in the shape of the mandelbrot set, which then generates high resolution mandelbrot set (preshing.com/20110926/…) - OT for this question but I thought people here might like it. | |
| Oct 1, 2011 at 6:56 | answer | added | Howard | timeline score: 6 | |
| Oct 1, 2011 at 0:46 | answer | added | Kibbee | timeline score: 3 | |
| Sep 30, 2011 at 16:43 | history | edited | dmckee --- ex-moderator kitten | CC BY-SA 3.0 |
import image
|
| Sep 28, 2011 at 19:06 | answer | added | stackman | timeline score: 1 | |
| Sep 28, 2011 at 18:56 | answer | added | stackman | timeline score: 18 | |
| Sep 13, 2011 at 13:19 | answer | added | J B | timeline score: 3 | |
| Jul 9, 2011 at 19:44 | answer | added | yogsototh | timeline score: 3 | |
| Jul 7, 2011 at 5:55 | history | tweeted | twitter.com/#!/StackCodeGolf/status/88848502960033792 | ||
| Jul 7, 2011 at 0:01 | comment | added | boothby | @Hannesh, I agree with dmckee. If you change the question, I'll be happy to add arguments. | |
| Jul 6, 2011 at 19:16 | comment | added | dmckee --- ex-moderator kitten | I have a personal preference for tasks that solve a class of problems rather than one instance. Making the region to use an input would makes this questions qualify. In any case, the specification is a bit light. In the future you can get help with these kinds of issues on the meta sandbox or the puzzle lab chat before you task goes live | |
| Jul 6, 2011 at 18:48 | answer | added | boothby | timeline score: 12 | |
| Jul 6, 2011 at 18:41 | history | edited | Hannesh | CC BY-SA 3.0 |
added 36 characters in body
|
| Jul 6, 2011 at 18:40 | comment | added | Hannesh | Well I was hoping I could just say "don't be a jerk" :D. We'll go with at least 40x30 then. | |
| Jul 6, 2011 at 18:04 | comment | added | Alexandru |
Or monochromatic .........................
|
|
| Jul 6, 2011 at 17:32 | comment | added | Howard |
Since the specification is a little bit unclear with respect to that point I can propose the following low-res ;-) 1-char php solution: *
|
|
| Jul 6, 2011 at 16:20 | history | asked | Hannesh | CC BY-SA 3.0 |