Accession Number:

AD0762017

Title:

Visible Surface Algorithms for Quadric Patches

Descriptive Note:

Corporate Author:

UTAH UNIV SALT LAKE CITY SCHOOL OF COMPUTING

Personal Author(s):

Report Date:

1970-12-01

Pagination or Media Count:

30.0

Abstract:

The paper describes two algorithms which find the visible portions of surfaces in a picture of a cluster of three-dimensional quadric patches. A quadric patch is a portion of quadric surface defined by a quadratic equation and by zero, one or several quadratic inequalities. The picture is cut by parallel planes called scan planes the visibility problem is solved in one scan plane at a time by making a good guess as to what is visible according to the visible portions found in the previous scan plane. The algorithm for intersecting patches works in a time roughly proportional to the number of patches involved and not to the square of this number as with some previous algorithms. Author

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE