CGL Meeting Agenda

Wednesday, September 02, 1998

Location:
DC 1304
Time:
1:30
Chair:
Dan Milgram

1. Adoption of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour this week:
volunteers?
Coffee hour next week:
Dan Milgram

3. Next meeting

Date:
Wednesday, September 09, 1998
Location:
DC 1304
Time:
1:30
Chair:
Erik Demaine (September 9th)
Technical presentation:
Shalini Aggarwal (September 9th)

4. Forthcoming

Chairs:
  1. Erik Demaine (September 9th)
  2. Ed Dengler (September 16th)
  3. Patrick Gilhuly (September 23rd)
Tech Presenters:
  1. Shalini Aggarwal (September 9th)
  2. Erik Demaine (September 16th)
  3. Ed Dengler (September 23rd)

5. Technical Presentations

Presenter:
Erik Demaine
Title:
Folding Polygons into Convex Polyhedra
Abstract:
This talk introduces the problem of folding a given polygon into convex
polyhedra. I discuss joint work with Martin Demaine, Anna Lubiw, and
Joseph O'Rourke in the area. In particular, I describe our algorithms
for listing all the polyhedra that a polygon can fold into. I show
the very surprising example of a cross (which folds up into a cube).
I discuss my current work in the area, including animation of foldings.
There will be several models and animations.

6. General Discussion Items

7. Action List


8. Director's Meeting

9. Seminars

DEPARTMENT OF COMPUTER SCIENCE

UNIVERSITY OF WATERLOO

SEMINAR ACTIVITIES



MASTER'S THESIS PRESENTATION







                    -Thursday, September 3, 1998



Kevin  Chow,  graduate student, Dept. Comp. Sci., Univ.

Waterloo,  will  speak  on ``Spatial Indexing Structure

for Fast Display''.





TIME:                2:00-3:00 p.m.



ROOM:                DC 1331







ABSTRACT



In this thesis, wa are going to propose a fully dynamic

spatial   indexing   structure   which   allows   swift

insertion,  deletion  and  range  query  operations  on

geometric objects at different levels of detail.



One  of  the important issue in spatial data management

is   displaying   of   spatial   data.   When  face  an

application  such  as a GIS, the system has to generate

maps  of different levels of resolutions.  Some spatial

indexing  structure  primarily  used  for  retrieval of

objects  within  a  specific  region are considered not

adequate  for  such  an  application,  due  to too much

details  on  display.  The remedy we offer here consist

two  techniques  in  cartography;  namely selection, as

well  as  simplification.  Selection means some objects

that are relatively unimportant to the user will not be

displayed  in  a small scale map.  Simplification means

that  objects will be displayed with sufficient but not

overly  detailed data enabling the user to rapidly find

the needed information.



We will perform various experiments on the new indexing

structures  to  show  how  selection and simplification

will  improve the search performance.  Experiments were

carried out base on real data obtained from the Faculty

of Enviromental Studies of the University of Waterloo.



-------------------------------------------------------



CS788 Advanced Image Synthesis 



  Interactive Global Illumination

  Carsten Whimster 



  Sept 4, 1998 

  1:00---2:00



  DC 1304



Hardware rendering, augmented with shadows, can be used to 

accelerate the last two bounces of a light path tracing global 

illumination algorithm. An implementation of this algorithm was 

performed, using a scattering of a few hundred infinitesimal 

area sources and the shadow volume reconstruction algorithm.

10. Lab Cleanup