Proceedings Seventh International Conference on Virtual Systems and Multimedia
DOI: 10.1109/vsmm.2001.969714
|View full text |Cite
|
Sign up to set email alerts
|

Towards realistic modeling and rendering of 3-D escape-time deterministic fractal shapes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…In equation (11), the parameter l = k log(2) is constant, therefore complete the proof. Table (2), illustrates the complexity rendering time comparison between our algorithm and other proposed techniques [10,24,22] for some fractal patterns.…”
Section: Resultsmentioning
confidence: 62%
“…In equation (11), the parameter l = k log(2) is constant, therefore complete the proof. Table (2), illustrates the complexity rendering time comparison between our algorithm and other proposed techniques [10,24,22] for some fractal patterns.…”
Section: Resultsmentioning
confidence: 62%
“…The process of building a fractal model is rapid as it is based on recursive algorithms. For instance, an array of 50000 pixels requires less than 8 seconds to be built using the IFS method and rendering algorithms for various FM methods are constantly optimized for productivity (Gröller, 1994;Karam and Nakajima, 2001;Martyn, 2010).…”
Section: Introduction Of a Fractal Classification Of Enps Aggregate Smentioning
confidence: 99%