6 search results - page 1 / 2 » Filled Julia Sets with Empty Interior Are Computable |
FOCM
2007
13 years 10 months ago
2007
We show that if a polynomial filled Julia set has empty interior, then it is computable.
STOC
2007
ACM
14 years 11 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CG
2004
Springer
13 years 10 months ago
2004
Springer
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
SIGGRAPH
2000
ACM
14 years 3 months ago
2000
ACM
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...