Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!decvax!decwrl!ucbvax!CSNET-RELAY.ARPA!HOLLAND%RCSMPA%gmr.com
From: HOLLAND%RCSMPA%gmr.com@CSNET-RELAY.ARPA.UUCP
Newsgroups: mod.ai
Subject: Seminar - Constructing the Aspect Graph (GMR)
Message-ID: <8608010509.AA10607@ucbvax.Berkeley.EDU>
Date: Mon, 28-Jul-86 23:18:00 EDT
Article-I.D.: ucbvax.8608010509.AA10607
Posted: Mon Jul 28 23:18:00 1986
Date-Received: Fri, 1-Aug-86 08:40:23 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 25
Approved: ailist@sri-ai.arpa


Seminar at General Motors Research Laboratories (GMR):


         An Algorithm for Constructing the Aspect Graph
                       Dr. Charles R. Dyer
                              of
                   Computer Science Department
                     University of Wisconsin
                       Madison, WI  53706
        
                    Thursday, August 14, 1986
        
        
       The aspect graph of a solid object is a representation of the visibility
       of the object's surfaces throughout surrounding viewing space.  In this
       talk we present tight bounds on the maximum size of aspect graphs and
       give worst-case optimal algorithms for their construction, first in the
       convex case and then in the general case.  The algorithm for the general
       case makes use of a new 3-D object representation called the aspect
       representation or "asp".  We also suggest several alternatives to the
       aspect graph which require less space and store more information.


-Steve Holland, Computer Science Department