The hidden line and hidden surface problems are often simpler when restricted to special classes of objects. An example is the class of grid surfaces, that is, graphs of bivariate functions represented by their values on a set of grid points. Projected grid surfaces have geometric properties which permit hidden line or hidden surface elimination to be done more easily than in the general case. These properties are discussed in this paper, and an algorithm is given which exploits them.
No takes yet. Share an insight, caveat, or question.
David P. Anderson (1982) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: