Logo by Tglad - 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 the official fractalforums.com Youtube Channel
 
*
Welcome, Guest. Please login or register. September 19, 2018, 07:37:10 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: continuous escape time for graph-directed IFS  (Read 627 times)
Description: same as regular IFS, but with a layer for each graph node
0 Members and 1 Guest are viewing this topic.
claude
Fractal Bachius
*
Posts: 563



WWW
« on: November 27, 2016, 09:52:35 PM »

In this blog post I presented continuous escape time for regular IFS:
https://mathr.co.uk/blog/2011-12-31_the_sky_cracked_open.html

Recently I extended my implementation to graph-directed IFS, where which transforms are allowed next depends on the previously applied transform.  Essentially it boils down to having one calculation texture per graph node - in OpenGL, GL_TEXTURE_2D_ARRAY is perfect, as you can sample from any layer according to a variable (which may vary according to transform index).  You can ping-pong between two GL_TEXTURE_2D_ARRAY, looping over layers with glFramebufferTextureLayer().

Working on tidying up code, you can see current scrappy stuff here: https://code.mathr.co.uk/graphgrow/blob/HEAD:/the-sky-cracked-open/main.hs

Obligatory image:

Logged
claude
Fractal Bachius
*
Posts: 563



WWW
« Reply #1 on: February 06, 2017, 10:43:21 AM »

Another approach gives nice images, and allows incremental rendering for animation: a more-straightforward multiple-copy-reduction method using floating point array textures with normalization to avoid overflow.

user interface:


corresponding output:


code:
https://code.mathr.co.uk/graphgrow/tree/HEAD:/graphgrow3/iface
https://code.mathr.co.uk/graphgrow/tree/HEAD:/graphgrow3/video
https://code.mathr.co.uk/graphgrow/tree/HEAD:/graphgrow3/audio
Logged
knighty
Fractal Iambus
***
Posts: 819


« Reply #2 on: February 06, 2017, 12:44:32 PM »

Cool!
Logged
Pages: [1]   Go Down
  Print  
 
Jump to:  

Related Topics
Subject Started by Replies Views Last post
Escape-time LRIFS Programming David Makin 11 3430 Last post March 22, 2010, 04:05:57 PM
by kram1032
Kaleidoscopic (escape time) IFS Sierpinski Gasket « 1 2 ... 9 10 » knighty 138 59270 Last post October 28, 2013, 10:23:48 PM
by Clemensson
Escape time versions of IFS IFS - Iterated Function Systems msltoe 2 4308 Last post April 18, 2011, 02:54:48 PM
by msltoe
Improving over the escape time map (new) Theories & Research megafiddle 1 293 Last post November 22, 2013, 03:38:37 AM
by megafiddle
Escape time kleinian (sort of) Other types knighty 8 1848 Last post January 30, 2015, 06:04:50 PM
by knighty

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.161 seconds with 27 queries. (Pretty URLs adds 0.011s, 2q)