Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!ucsd!sdcsvax!net1!hutch
From: hutch@net1.ucsd.edu (Jim Hutchison)
Newsgroups: comp.graphics
Subject: Re: Fractal Compression (More)
Keywords: L-systems fractals trees compression
Message-ID: <4964@sdcsvax.UCSD.EDU>
Date: 22 May 88 22:46:58 GMT
References: <686@thalia.rice.edu> <5546@cup.portal.com>
Sender: nobody@sdcsvax.UCSD.EDU
Reply-To: hutch@net1.UUCP (Jim Hutchison)
Lines: 18

<>
So what we have here is a library of shapes to replace the squares given
out for quadtree methods, and a replacement for the quadtree which is
a fractal tree?  This is a first impression.  It would seem that it might
also be possible to design a similiar compression technique using L-systems.

Then you could replace the shape library with a riff library, and play it! :-)

Seriously, what advantages does the "fractal" system have over L-systems in
this case?  L-systems failed to adequately represent natural models, but this
is not a natural model.  This is a jumble of polygons which represent pools
of color (which could be extended to overlap).

Any thoughts?

    Jim Hutchison   		UUCP:	{dcdwest,ucbvax}!cs!net1!hutch
		    		ARPA:	Hutch@net1.ucsd.edu
Disclaimer:  The cat agreed that it would be o.k. to say these things.