Logo by mrob - 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: Did you know ? you can use LaTex inside Postings on fractalforums.com!
 
*
Welcome, Guest. Please login or register. April 26, 2024, 02:51:02 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]   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: Question on Distance estimator algorithms from Science of Fractal Images  (Read 7411 times)
0 Members and 1 Guest are viewing this topic.
Duncan C
Fractal Fanatic
****
Posts: 348



WWW
« on: June 07, 2007, 04:17:23 PM »

Greetings all.

A while back I posted a question on how the black and white Mandelbrot and Julia images from "The Beauty of Fractals" were generated.

I've since found documentation in "The Science of Fractal Images" that states that these images were generated using the Distance Estimator Method (or DEM) as documented on pages 196 - 199.

The algorithm involves calculating the derivative of the iterated function

   Zn+1 = Zn+ C

That section includes separate mathematical definitions of DEM algorithms for Mandelbrot and Julia sets. The text also includes pseudo-code for the Mandelbrot version of the DEM algorithm, but no pseudo-code for the Julia version

It's been a LONG time since I took calculus, and the notation used in these texts is rather hard to follow, at least for me.

As far as I can tell, the only differences between the Mandelbrot and Julia versions of the DEM functions is that the Mandelbrot function has a "+1" term in the iterated derivative function, while the Julia version does not, and the derivative of the first Z0 iteration, Z'0, is 0 for the Mandelbrot version of the equation, and Z'0 is 1 for the Julia version of the equation.

The formula for the distance estimate of a Mandelbrot, where Zk is the result of the K iteration of the iterated function, is as follows:

   Z'k+1 = 2  Zk  Z'k +1, Z'0 = 0, k = 0, 1, ..., n-1

For Julia set DEM, the formula is

   Z'k+1 = 2  Zk  Z'k, Z'0 = 1, k = 0, 1, ..., n-1

Can you folks look over the algorithms (DEM M on page 196 and DEM/J on page 199) and see if there are any differences I'm missing?

Have any of you used these DEM algorithms to color plots, or as height maps for 3D plots? As far as I can tell, most of the 3D plots in "The Beauty of Fractals" and "The Science of Fractal Images" use the Continuous Potential Method (which is based on the log-log of the result of the result of the last iteration.)

The only example of a 3D plot that uses the DEM algorithm (map 30, on page 121 of "The Science of Fractal Images") looks like it only uses 2 height values, "far from the set" and "near to the set."




Duncan C
Logged

Regards,

Duncan C
Pages: [1]   Go Down
  Print  
 
Jump to:  

Related Topics
Subject Started by Replies Views Last post
Mandelbrot Distance Estimator Zoom Movies Showcase (Rate My Movie) cKleinhuis 4 3853 Last post March 25, 2008, 12:53:41 PM
by lycium
How is the "distance estimator" derived? Theory pauldoo 1 5980 Last post June 07, 2010, 10:04:11 PM
by David Makin
Distance Estimator for Perlin noise General Discussion willvarfar 5 4066 Last post September 22, 2013, 10:00:45 AM
by Mrz00m
Problem with Mandelbrot Distance Estimator Mandelbrot & Julia Set Levi 14 9437 Last post February 20, 2015, 04:13:13 PM
by Adam Majewski
Mandelbrot Set Distance Estimator Rendering Problem UltraFractal aleph0 5 11227 Last post April 30, 2014, 01:08:45 AM
by aleph0

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.259 seconds with 24 queries. (Pretty URLs adds 0.012s, 2q)