🚀 go-pugleaf

> In article <2A8953B3.6635@deneva.sdd.trw.com> thomsen@spf.trw.com (Mark Thomsen) writes:

> Bryan Morse writes
> > ..."Splat" explaination given as a snowball analogy....

> This can work provided that the "size of the snowball" is correct for
> the output grid. If the output grid is sparse relative to the input grid
> then it should work fine with lots of small snowballs - small intensities
> and small area (suggest adding based on original intensities and then
> normalizing/scaling values). If the output grid is dense relative to the
> input grid then the snowballs should have large area (to ensure every
> output grid point is covered) and large intensities (one snowball
> "splats" many grid points).

Actually, the "Splat" algorithm incorporates a user definable "error"
factor, that eliminates this problem.

> I would be most interested in seeing an algorithm statement, either in
> a posting or by reference to a paper (or book?).

The canonical reference paper is:

"Heirarchical Splatting: A Progressive Refinement Algorithm for Volume Rendering"
	Larr, D. and P. Hanrahan
	ACM Computer Graphics,
	Volume 25, Number 4
	pp 285-288

> Mark R. Thomsen

Have fun.


--


 - Rob DeMillo			| Internet: 	  demillo@juliet.ll.mit.edu
   MIT Lincoln Lab 		| America Online: exgalileo@aol.com
   Weather Sensing - Group 43	| Reality:        617-981-2105 (office)

"Operation Goofy now in effect!"
	--- Tom Servo, "Gamera vs. Gaos," Mystery Science Theater 3000