Visible surface algorithms for quadric patches

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator Mahi, Robert
Title Visible surface algorithms for quadric patches
Date 1970
Description This 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 t o what is visible according to the visible portions found in the previous can 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).
Type Text
Publisher University of Utah
Subject surface algorithms; quadric patches
Language eng
Bibliographic Citation Mahi, R. (1970). Visible surface algorithms for quadric patches. 1-22. UTEC-70-111; UTEC-CSc-70-111.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 4,216,687 bytes
Identifier ir-main,16055
ARK ark:/87278/s6cj8xsz
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-24
ID 704102
Reference URL
Back to Search Results