Logo by Khaotik - Contribute your own Logo!

END OF AN ERA, FRACTALFORUMS.COM IS CONTINUED ON FRACTALFORUMS.ORG

it was a great time but no longer maintainable by c.Kleinhuis contact him for any data retrieval,
thanks and see you perhaps in 10 years again

this forum will stay online for reference
News: Visit us on facebook
 
*
Welcome, Guest. Please login or register. March 28, 2024, 05:59:06 PM


Login with username, password and session length


The All New FractalForums is now in Public Beta Testing! Visit FractalForums.org and check it out!


Pages: 1 2 [3]   Go Down
  Print  
Share this topic on DiggShare this topic on FacebookShare this topic on GoogleShare this topic on RedditShare this topic on StumbleUponShare this topic on Twitter
Author Topic: Deepest - e10000  (Read 15541 times)
0 Members and 2 Guests are viewing this topic.
Kalles Fraktaler
Fractal Senior
******
Posts: 1458



kallesfraktaler
WWW
« Reply #30 on: March 01, 2016, 10:54:55 PM »

Code:
$ m-box-period 53 -0.8691524744 0.2556487868 1.25e-5 1000
48
It would be really nice if you could make executables for Windows available on your site wink
Logged

Want to create DEEP Mandelbrot fractals 100 times faster than the commercial programs, for FREE? One hour or one minute? Three months or one day? Try Kalles Fraktaler http://www.chillheimer.de/kallesfraktaler
http://www.facebook.com/kallesfraktaler
stardust4ever
Fractal Bachius
*
Posts: 513



« Reply #31 on: March 11, 2016, 11:35:41 AM »

So basically through some kind of mathematical voodoos I won't pretend to understand, you can basically find a minibrot of any period, anywhere in the set, at any depth, without the manual work of zooming through the infinite cosmos. The limiting factor to depth is now the horsepower of your CPU and patience of the mandelbrot explorer.

Don't get me wrong, while technically impressive to find eternally deep minibrots, the automated process strips nearly all creativity out of the zoom sequence.

@KF: I watched the first 6 and last 6 minutes of your YT vid. Let's say I am thankful not to suffer from epilepy.  tongue stuck out

@claude: I would be most interested in using this automated brot finding process to cut out the long hours of tedious manual zooming in between scenes when creating sophisticated patterns... grin

I discussed this a bit in the superfractalthing reboot thread.
Logged
claude
Fractal Bachius
*
Posts: 563



WWW
« Reply #32 on: April 07, 2016, 12:17:55 AM »

I rerendered this location in my own software using distance estimation, still not recommending to sit down and watch it like you would a film, so I picked some nice ambient drones as soundtrack...

https://archive.org/details/e10000

I think I started rendering it at the start of January, had to stop and fix software bugs a few times before continuing the render.. at least my program has fewer bugs now smiley
Logged
quaz0r
Fractal Molossus
**
Posts: 652



« Reply #33 on: April 07, 2016, 12:54:56 AM »

thanks for the share   smiley   what method do you use for making zooms?  there was a post on here about mercator maps or something but the thread died without much further discussion
Logged
claude
Fractal Bachius
*
Posts: 563



WWW
« Reply #34 on: April 07, 2016, 02:33:08 AM »

I blend between successive 2x zoom level images, using the blending factors here https://mathr.co.uk/blog/2010-08-31_optimizing_zoom_animations.html (and also motion-blur with the shutter open for 1/2 the frame time)  source code here: https://code.mathr.co.uk/mightymandel/blob/8f45039d55408902d0d0c2723ed27fce65e10f14:/extra/zoom.c

I have used mercator map / exponential strip method in the past (my "emndl" project circa 2011), but I haven't added it to my pertubration renderer(s) yet - it's a bit fiddly to get right and it isn't suitable for interactive uses...
Logged
quaz0r
Fractal Molossus
**
Posts: 652



« Reply #35 on: April 07, 2016, 09:14:48 PM »

that audio track is pretty epic too.  the last ten minutes i felt like i was flying through the wormhole in 2001 a space odyssey   shocked
Logged
Kalles Fraktaler
Fractal Senior
******
Posts: 1458



kallesfraktaler
WWW
« Reply #36 on: April 07, 2016, 10:15:01 PM »

Very cool!
It shouldn't be hard for you to make even deeper zooms, despite the time consuming render... smiley
Logged

Want to create DEEP Mandelbrot fractals 100 times faster than the commercial programs, for FREE? One hour or one minute? Three months or one day? Try Kalles Fraktaler http://www.chillheimer.de/kallesfraktaler
http://www.facebook.com/kallesfraktaler
claude
Fractal Bachius
*
Posts: 563



WWW
« Reply #37 on: February 19, 2017, 10:39:34 AM »

...
I had to update my floatexp class (used when deeper than e4920) so that it is based on 2 instead of 10 and masks off the exponent and handle it separately. That made it much faster than before, which was necessary to be able to complete this render in reasonable time.
...

I've been working on accelerating my own edouble variant of the floatexp idea today.  Made it almost three times as fast as before by using your masking code (thanks!) instead of ldexp/frexp libm calls, and annotating the branches with __builtin_expect (gcc-specific, maybe) to help CPU branch prediction.

My edouble code is still ~2x slower than your floatexp (compiled with the same compiler), but it does correctly handle 0 (with underflow), infinities (with overflow), and NaN.

But I worry that your floatexp might sometimes interpret 0.0 as 1x2^-1024 or so - I don't know how likely that is to occur in practice...

My code is here: https://code.mathr.co.uk/mandelbrot-perturbator/blob/HEAD:/lib/edouble.cc
Your code on my hard disk is dated May 22 2014, not sure which version that corresponds to.
Logged
Kalles Fraktaler
Fractal Senior
******
Posts: 1458



kallesfraktaler
WWW
« Reply #38 on: February 19, 2017, 02:33:52 PM »

I've been working on accelerating my own edouble variant of the floatexp idea today.  Made it almost three times as fast as before by using your masking code (thanks!) instead of ldexp/frexp libm calls, and annotating the branches with __builtin_expect (gcc-specific, maybe) to help CPU branch prediction.

My edouble code is still ~2x slower than your floatexp (compiled with the same compiler), but it does correctly handle 0 (with underflow), infinities (with overflow), and NaN.

But I worry that your floatexp might sometimes interpret 0.0 as 1x2^-1024 or so - I don't know how likely that is to occur in practice...

My code is here: https://code.mathr.co.uk/mandelbrot-perturbator/blob/HEAD:/lib/edouble.cc
Your code on my hard disk is dated May 22 2014, not sure which version that corresponds to.
Cool, I haven't updated it since that date.
I haven't encoutered any problems that 0 is not actually 0...
Logged

Want to create DEEP Mandelbrot fractals 100 times faster than the commercial programs, for FREE? One hour or one minute? Three months or one day? Try Kalles Fraktaler http://www.chillheimer.de/kallesfraktaler
http://www.facebook.com/kallesfraktaler
quaz0r
Fractal Molossus
**
Posts: 652



« Reply #39 on: February 20, 2017, 02:06:09 AM »

ldexp/frexp is epically, ridiculously, unusably slow indeed.  i use union casting for the masking code though, which is at least explicitly supported by compiler vendors (while still technically undefined behavior by the C++ standard), whereas kalle's C-style casting is entirely undefined by anyone anywhere anytime.  i forget if modern compilers just complain very loudly about it if you try to compile it, or if they now flat-out refuse to compile it at all.
Logged
Kalles Fraktaler
Fractal Senior
******
Posts: 1458



kallesfraktaler
WWW
« Reply #40 on: February 20, 2017, 09:29:57 AM »

ldexp/frexp is epically, ridiculously, unusably slow indeed.  i use union casting for the masking code though, which is at least explicitly supported by compiler vendors (while still technically undefined behavior by the C++ standard), whereas kalle's C-style casting is entirely undefined by anyone anywhere anytime.  i forget if modern compilers just complain very loudly about it if you try to compile it, or if they now flat-out refuse to compile it at all.
Yes you are right, I will use your strategy from now and not share anything ever again sad
Logged

Want to create DEEP Mandelbrot fractals 100 times faster than the commercial programs, for FREE? One hour or one minute? Three months or one day? Try Kalles Fraktaler http://www.chillheimer.de/kallesfraktaler
http://www.facebook.com/kallesfraktaler
quaz0r
Fractal Molossus
**
Posts: 652



« Reply #41 on: February 20, 2017, 12:12:02 PM »

relax bro, i was just commenting on C++ issues   kiss
Logged
Pages: 1 2 [3]   Go Down
  Print  
 
Jump to:  

Related Topics
Subject Started by Replies Views Last post
Not the deepest but maybe the prettiest Mandelbrot Zoom Movies Showcase (Rate My Movie) panzerboy 3 3819 Last post June 06, 2011, 10:31:48 AM
by DOMEHEAD
Deepest known image Mandelbrot & Julia Set « 1 2 » LesPaul 27 8272 Last post May 10, 2013, 09:27:50 AM
by grobblewobble
Double release: Golden zoom + Record deepest Mandelbrot set zoom E1500 or 2^5000 Movies Showcase (Rate My Movie) « 1 2 » Dinkydau 28 20484 Last post June 20, 2013, 10:45:05 PM
by rollercoaster158
Deepest Cubic Burning Ship Movies Showcase (Rate My Movie) Kalles Fraktaler 5 1745 Last post November 17, 2014, 11:51:45 AM
by PieMan597

Powered by MySQL Powered by PHP Powered by SMF 1.1.21 | SMF © 2015, Simple Machines

Valid XHTML 1.0! Valid CSS! Dilber MC Theme by HarzeM
Page created in 0.202 seconds with 24 queries. (Pretty URLs adds 0.014s, 2q)