Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9655996 | Electronic Notes in Theoretical Computer Science | 2005 | 13 Pages |
Abstract
The algorithm given in this paper computes Julia sets locally in time O(kâ
M(k)) (where M(k) denotes the time needed to multiply two k-bit numbers). Roughly speaking, the local time complexity is the number of Turing machine steps to decide a set of disks of spherical diameter 2âk so that the union of these disks has Hausdorff distance at most 2âk+2. This allows to give reliable pictures of Julia sets to arbitrary precision.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Robert Rettinger,