
    Draw a recursive tetrahedron ala Mandelbrot.
  
    Produces sun 'shaded' format or ``Blinn'' format:

  
    Usage: a.out [-l<len> -m<minlen> -x<xcent> -y<ycent> -z<zcent> -f<file>]
  
	    len		length of an edge
	    minlen	the length of subdivided edge at which to stop
	    xcent	x center of object
	    ycent	y center of object
	    zcent	z center of object
	    file	output file
  

    Author: Jim Hutchison <hutch@sdcsvax.ucsd.edu>


    Compiler Flags:

	BLINN	-- output in Jim Blinn's format, only author I could find.
	FAT	-- do not free any allocated memory, usually for fat machines.
		   free() is a relatively slow operation.

    Format of output file (compiled with -DBLINN):

	<TAB>Comment
	PNT id, x, y, z
	POLY ptnumber1, ptnumber2, ... ptnumberN

      example:

		THIS FILE HAS AN AARDVARK IN IT
	
	PNT 1, 1.0, 3.5, 9.7
	PNT 2, 1.0, 2.5, 9.7
	PNT 3, 3.0, 3.5, 1.7
	POLY 1, 2, 3
	PNT 4, 5.0, 3.5, 3.7
	POLY 2, 4, 1

    Format of output file (compiled without -DBLINN):

	points polygons
	minx maxx miny maxy minz maxz
	p1x py1 p1z
	...
	Nsides ptnumber1 ptnumber2 ... ptnumberN
	...
	3 1 2 3						<-- for example
