[comp.graphics] What is best hidden line removal algorithm?

ubi@unix.SRI.COM (Ron Ueberschaer) (02/19/88)

Given a function of two variables f(x,y), uniformly sampled in x
and y, what is the easiest and most efficient way of plotting the
surface f with grid lines running in the x and y directions?

To achieve effective hidden line removal, it seems that interpolation
is necessary since the sampling density is likely to be less than the
plotter resolution.  Also, the number of samples in each direction and
the viewing angle should be variables in the algorithm.

References to books or articles detailing a good algorithm are
appreciated.  I subscribe to ACM SIGGRAPH AND IEEE CGS, and the
articles I've seen are at a much more complex level than what I'm
looking for.

					Advance Thanks,

  "For every complex problem,		--Ron Ueberschaer
   there is a solution that		  SRI International	Menlo Park, CA
   is simple, neat, and wrong."		  ...!{hplabs,rutgers}!sri-unix!ubi
	-- H. L. Mencken		  ubi@sri-unix.uucp
-- 
  "For every complex problem,		--Ron Ueberschaer
   there is a solution that		  SRI International	Menlo Park, CA
   is simple, neat, and wrong."		  ...!{hplabs,rutgers}!sri-unix!ubi
	-- H. L. Mencken		  ubi@sri-unix.uucp