• Login
    View Item 
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • CS Technical Reports
    • View Item
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • CS Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Using the ASP for the Interactive Viewing of Polyhedral Scenes

    Thumbnail
    File(s)
    TR903.pdf (3.723Mb)
    Date
    1989
    Author
    Seales, W. Brent
    Dyer, Charles R
    Publisher
    University of Wisconsin-Madison Department of Computer Sciences
    Metadata
    Show full item record
    Abstract
    In this paper, we discuss an approach for solving the problem of interactively viewing a polyhedral scene. Interactive viewing is the computation and display of an interactively controlled sequence of views of a scene corresponding to a viewer�s movement along a continuous viewpath. We present an algorithm for generating such views with hidden-lines removed, and consider extensions to solve the problem of generating views with hidden-surfaces removed. The method relies on a precomputation phase which constructs the aspect representation, or asp. This representation can be used to interactively view a polyhedral scene at video rates with hidden-lines or surfaces removed. The method exploits viewpath coherence, a form of frame-to-frame coherence present in such a sequence of views. The display of polyhedral line drawings with hidden lines removed makes use of the topology of the image line drawing and the pre-ordering of visual events which change that topology. This approach is extended to interactive viewing with hidden-surfaces removed and with shading, shadows, and multiple light sources. The set of object resolution polygons representing the visible faces and the shadow polygons for a single frame can be computed efficiently from the previous frame using the asp. The hidden-line and hidden-surface algorithms are closely related via the asp. Interactive viewing with hidden-lines removed is shown to be about as fast as the interactive display of a wire-frame scene. The primary on-line cost of hidden-surface interactive viewing is the cost associated with scan converting the visible surfaces and shadow polygons.
    Permanent Link
    http://digital.library.wisc.edu/1793/59236
    Type
    Technical Report
    Citation
    TR903
    Part of
    • CS Technical Reports

    Contact Us | Send Feedback
     

     

    Browse

    All of MINDS@UWCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Contact Us | Send Feedback