Content deleted Content added
Adding class, importance & field to maths rating template |
m Maintain {{WPBS}}: 2 WikiProject templates. Keep majority rating "B" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Systems}}. Keep 1 different rating in {{WikiProject Mathematics}}. Remove 1 deprecated parameter: field. Tag: |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1:
{{talkheader}}
{{WikiProject banner shell|class=B|
{{
{{
}}
{{archive box|auto=yes}}
Line 55:
[[User:Kragen|Kragen Javier Sitaker]] ([[User talk:Kragen|talk]]) 06:19, 19 July 2014 (UTC)
== Zooming ==
The article says that zooming in on an IFS fractal using the deterministic and random iteration algorithms is impractical.
This may not be the case, depending on how broadly you conceive each algorithm. I've been investigating producing high depth zooms, using a modification of the (depth first) deterministic iteration algorithm and reached a zoom of 5 × 10<sup>150</sup>, using native 64 bit floating point arithmetic, without any noticeable deterioration in image quality, at little cost in extra computation time. At this point I hit an arithmetic overflow in the calculation of how deep the iterations should be, but this code can be refactored to avoid this. The modified code is ticking away and has reached a zoom 7 × 10<sup>190</sup>. It may be possible to get to over 10<sup>600</sup>.
The modification is to combine a shallow depth first deterministic algorithm with a pruned breadth first deterministic algorithm (i.e. selecting only those branches in the deeper parts of the tree which lie within the zoom).
I haven't tried it yet, but combining a random iteration algorithm with the same pruned breadth first deterministic algorithm, should also work. [[User:Lavateraguy|Lavateraguy]] ([[User talk:Lavateraguy|talk]]) 16:48, 3 November 2016 (UTC)
| |||