Hidden Line Elimination in Projected Grid Surfaces.

Abstract

Hidden line and hidden surface problems are often simpler when restricted to special classes of objects. An example is the class of grid surfaces, i.e. 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 then in the general case. These properties are discussed in this paper and an algorithm is given which exploits them. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1982
Accession Number
ADA124348

Entities

People

  • David P. Anderson

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Cartesian Coordinates
  • Coordinate Systems
  • Crossings
  • Discontinuities
  • Elimination
  • Grids
  • Lists (Data Structures)
  • Mathematics
  • Military Research
  • Numbers
  • Security
  • Two Dimensional
  • United States
  • Universities
  • Wisconsin

Readers

  • Computational Fluid Dynamics (CFD)
  • Regression Analysis.
  • Sensor Fusion and Tracking Systems.