Abstract. In this paper, we present a parallel fractal image compression using the programmable graphics hardware. The main problem of fractal compression is the very high computin...
Fractal objects like Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of s...
Aditya Kapoor, Kush Arora, Ajai Jain, G. P. Kapoor
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
We present a novel use of commodity graphics hardware that effectively combines a plane-sweeping algorithm with view synthesis for real-time, on-line 3D scene acquisition and view...