Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Hidden Feature Elimination and Visible Polygon Return in UNIGRAFIX 2

Paul Wensley

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-84-172
April 1984

http://www.eecs.berkeley.edu/Pubs/TechRpts/1984/CSD-84-172.pdf

UNIGRAFIX is a graphics rendering system that runs under the UNIX operating system. It consists of a descriptive language and several programs that allow a user to create, modify, and display scenes consisting of polyhedral objects. UNIGRAFIX 2 is an enhanced and refined implementation of the original UNIGRAFIX system created by Paul Strauss.

UNIGRAFIX 2 relies on a new hidden surface algorithm based on the CROSS algorithm by Hamlin and Gear. In this algorithm visibility information is passed from vertices to edges, and through those to other vertices. At crossings of contour edges, visibility is reexamined. This algorithm is ideally suited for efficient computations of all visible polygons. A new option, -vf, has been added to Unigrafix, that will write all visible polygons to a specified file.


BibTeX citation:

@techreport{Wensley:CSD-84-172,
    Author = {Wensley, Paul},
    Title = {Hidden Feature Elimination and Visible Polygon Return in UNIGRAFIX 2},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1984},
    Month = {Apr},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1984/5191.html},
    Number = {UCB/CSD-84-172},
    Abstract = {UNIGRAFIX is a graphics rendering system that runs under the UNIX operating system. It consists of a descriptive language and several programs that allow a user to create, modify, and display scenes consisting of polyhedral objects.  UNIGRAFIX 2 is an enhanced and refined implementation of the original UNIGRAFIX system created by Paul Strauss.  <p>  UNIGRAFIX 2 relies on a new hidden surface algorithm based on the CROSS algorithm by Hamlin and Gear. In this algorithm visibility information is passed from vertices to edges, and through those to other vertices. At crossings of contour edges, visibility is reexamined. This algorithm is ideally suited for efficient computations of all visible polygons. A new option, -vf, has been added to Unigrafix, that will write all visible polygons to a specified file.}
}

EndNote citation:

%0 Report
%A Wensley, Paul
%T Hidden Feature Elimination and Visible Polygon Return in UNIGRAFIX 2
%I EECS Department, University of California, Berkeley
%D 1984
%@ UCB/CSD-84-172
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1984/5191.html
%F Wensley:CSD-84-172