Fractal image compression based on delaunay triangulation
Published in Papers/Documentation, Fractals
PhD thesis by Franck Davoine, 20 December 1995. The key to a good fractal compression algorithm is the method by which it breaks down segments of an image into smaller pieces, called partitioning. Davoine introduces a partitioning method based on Delaunay triangulation.
ftp://ftp.imag.fr/pub/Mediatheque.IMAG/theses/95-Davoine.Franck/notice-anglais.html
* *
Posted in July 4th, 2000
No User Commented In " Fractal image compression based on delaunay triangulation "
Subscribes to this post Comment RSS or TrackBack URL
