Logo by JosLeys - Contribute your own Logo!


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. June 29, 2022, 06:13:27 AM

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
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: Escape time kleinian (sort of)  (Read 3419 times)
Description: Early results
0 Members and 1 Guest are viewing this topic.
Fractal Iambus
Posts: 819

« on: January 04, 2015, 08:57:19 PM »

Happy new year everyone!

Here are the first results for rendering kleinian fractals a la "Escape time". The ultimate goal is rendering 3D kleinians at interactive rates (and on GPU if possible) such as those done by Jos Leys.

The algorithm outputs for each pixel a value that is zero on the limit set. Its outline follows:
1- Requirements:
-- the set of Ford circles that form a fundamental domain for the kleinian: The Ford fundamental domain is defined as the exterior of the union of the isometric circles of all the elements of the kleinian group. If the group is not degenerate only a finite number of them have to be considered. For now, I find such circles manually but there is a pattern. Details later  cheesy.
-- The area [outside] that is such that: it doesn't contain the limit set And Contains the fundamental domain: It's the union of some discs That are also found manually for now... but there is a pattern...

2- Processing: for each point P (corresponding to a pixel):
--> Repeat until the point is inside the fundamental domain (or max iterations attained):
---->For each transformation corresponding to the Ford fundamental domain:
------>If the derivative of the transformation at P is >1 apply it.
When P is inside the fundamental domain there is no transformation such that the derivative is >1 so we have a criteria to stop the algorithm. This idea is cited in indra pearles book. Also if meanwhile, P falls [outside] we already know that it doesn't belong to the limit set.
--> color P using some function of it's final position/[outside], the cumulated derivative...etc. A DE could be computed this way but I haven't worked it out yet.

Attached a couple of evaldraw scripts.

PS: Sorry for the headache.  grin

* LimitSet_1-1.jpg (88.13 KB, 640x500 - viewed 673 times.)

* LimitSet_0-1.jpg (75.57 KB, 560x960 - viewed 691 times.)
* ET-Kleinians.zip (8.5 KB - downloaded 350 times.)
« Last Edit: January 05, 2015, 08:32:35 PM by knighty » Logged
Adam Majewski
Fractal Lover
Posts: 221

« Reply #1 on: January 04, 2015, 09:18:50 PM »

Great. Thx. What is the licence of your code ? Can I run evaldraw only on windows ?
Global Moderator
Fractal Senior
Posts: 1558

« Reply #2 on: January 04, 2015, 09:34:49 PM »

Evaldraw runs under Wine on linux, but has problems when executed from the linux desktop directly, open the Wine desktop emulation window first and run the exe file from there through explorer, otherwise the hotkey commands don't work (SuSE 12.3)

PS knighty, I got your polyroot script running on linux smiley
« Last Edit: January 04, 2015, 09:36:55 PM by 3dickulus, Reason: PS » Logged

Resistance is fertile...
You will be illuminated!

                            #B^] https://en.wikibooks.org/wiki/Fractals/fragmentarium
Fractal Senior
Posts: 7044

formerly known as 'Trifox'

« Reply #3 on: January 04, 2015, 10:04:55 PM »

hui, happy new year as well, starting the year with a new technique? as far as i know kleinian escape time methods are not available until now, they look just awesome, hrhr time to hybridise such wink


divide and conquer - iterate and rule - chaos is No random!
Fractal Iambus
Posts: 819

« Reply #4 on: January 05, 2015, 01:44:10 PM »

Strictly speaking, it is not an escape time algorithm like mandelbrot set for example. The criteria of 'escaping' is different and rely on the derivative instead of the norm of the iterate. It doesn't mean that hybridising is impossible. It would be different (and more involved IMHO):
For example, a Julia set could be seen as a 'group' if we add inverse. The generators would be:
f(z)=z▓+c and f-1(z)=+-sqrt(z-c)
We can't say that we have a group because f(z) have two inverses. A Julia set is symmetric about the origin so we can take one of the inverses provided we add a rotation of 180░ around the origin... Anyway... We could add generators as some M÷bius stransformations, say, a,b and their ineverses A,B. The whole set of generators will be:
Rotation of 180░ about (0,0) which is it's own inverse. (it is simply a multiplication by -1)
Then the hybrid would be defined as the set invariant under this group. drawing such a set is another story. Moreover, I don't know if my reasonning is correct.

@Adam Majewski :
I've added a copyright notice (just for the disclaimer). It's derived from zlib license.

@ 3dickulus :
Thank you for the tip about running evaldraw under linux.

Peter Liepa, has already drawn tilings of the ordinary set. I think the method he used is not different from mine. Unfortunately, he don't give much details about his algorithms.

Edit: Scripts updated. Don't forget to press space bar to change rendering style. smiley
« Last Edit: January 05, 2015, 08:33:48 PM by knighty » Logged
Strange Attractor
Posts: 258

« Reply #5 on: January 06, 2015, 07:57:05 PM »

We can always count on Knighty for something new!

Global Moderator
Fractal Senior
Posts: 2512

Fragments of the fractal -like the tip of it

« Reply #6 on: January 28, 2015, 12:56:04 AM »

You are my hero Knigty... beautiful mind! A Beer Cup

No sweat, guardian of wisdom!
« Reply #7 on: January 28, 2015, 04:31:45 PM »

I'm hoping this quiet time from Knighty means he is working on something amazing!
Fractal Iambus
Posts: 819

« Reply #8 on: January 30, 2015, 06:04:50 PM »

Thanks. smiley

Unfortunately, It seems that there is not easy to find the fundamental domain. The only methods I found in the net are:

- Opti: OPTiĺs Algorithm for Discreteness Determination and Creating software for visualizing kleinian groups. Works only for "punctured tous groups" in "Jorgensen normalisation". I'll try to use it because the python program included in the second article makes the method clear. I don't kow if and how it could be extended to 3D.

- "Computing fundamental domains for arithmetic Kleinian groups". It doesn't correspond to the kleinian groups I'm interested in but the method is desribed in detail.

Peter Liepa have already found a method to draw tilings based on kleinian groups but he doesn't give the details of his methods.

It's not easy at all... sad

Pages: [1]   Go Down
Jump to:  

Related Topics
Subject Started by Replies Views Last post
Escape-time LRIFS Programming David Makin 11 5150 Last post March 22, 2010, 04:05:57 PM
by kram1032
Escape time versions of IFS IFS - Iterated Function Systems msltoe 2 5935 Last post April 18, 2011, 02:54:48 PM
by msltoe
Improving over the escape time map (new) Theories & Research megafiddle 1 613 Last post November 22, 2013, 03:38:37 AM
by megafiddle
Mandelbrot set zoom with continous escape time Images Showcase (Rate My Fractal) Adam Majewski 0 1315 Last post May 13, 2015, 09:39:48 PM
by Adam Majewski
An escape time algorithm for Kleinian group limit sets 3D Fractal Generation « 1 2 ... 8 9 » JosLeys 124 26484 Last post March 23, 2017, 01:38:46 PM
by ericr

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