Vectorization techniques for algebraic fractals

Simple item page
dc.contributor.authorBhavsar, V., C.
dc.contributor.authorGujar, U., G.
dc.contributor.authorVangala, N.
dc.date.accessioned2023-03-01T18:27:50Z
dc.date.available2023-03-01T18:27:50Z
dc.date.issued1990
dc.description.abstractAlgebraic fractals generated from the self-squared transformation function z <— z[superscript 2] + c, where z and c are complex quantities, have been discussed extensively in the literature. The process of generating these fractal images, being iterative in nature, is computationally intensive. In this paper we propose and study three vectorization techniques for generating algebraic fractals from z <— z[superscript 2] + c, namely, use of long vectors, short vectors and short vectors with replenishment. The speedups obtained by vectorization of all these techniques on IBM 3090-180VF, which has a vector facility, are presented. It is observed that the technique of using short vectors with replenishment is the best.
dc.description.copyrightCopyright @ V. C. Bhavsar, U. G. Gujar, and N. Vangala, 1990.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14788
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleVectorization techniques for algebraic fractals
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
561.78 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports