CGL Meeting Agenda
Wednesday, January 25 1995
- Location:
- DC 1304
- Time:
- 1:30 PM
- Chair:
- Saar Friedman
1. Adoption of the agenda - additions/deletions thereto.
2. Coffee Hour and Next Meeting:
- Coffee hour this week:
- ???
- Coffee hour next week:
- ???
- Next Meeting
-
- Time:
- February 1, 1995
- Location:
- DC 1304
- Chair:
- Rob Kroeger
- Tech Presentation:
- Bill Cowan
- Forthcoming: (list next 4 and trades)
-
- Chairs:
- Rob Kroeger
- Wayne Liu
- Sandra Loop
- Steve Mann
- Tech presentations:
- Bill Cowan (moved from Dec. 14)
- Saar Friedman (2 weekds after move-to date)
- Rick Kazman
- Nathan Konrad
3. Technical Presentation:
- Presenter:
- Fabrice Jaubert
- Title:
- Short introduction to xhier
- Abstract:
- CGL depends on xhier, developped by MFCF, for all of its software. This
system is largely misunderstood by lab members; I will attempt to make its
purpose and some of its workings clear.
4. General Discussion Items:
-
5. Action List (remember to update AL_active)
- Side Effects Visit
6. Directors Meeting:
7. Seminar(s):
DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES
DATA STRUCTURES SEMINAR
-Friday, January 27, 1995
Svante Carlsson, University of Lulea, Sweden, will
speak on "Guarding with Mobile Guards" (note title change)
This is a joint work with Hakan Jonsson and Bengt Nilsson.
TIME: 12:30-1:30
ROOM: DC 1331
ABSTRACT
We present the first polynomial-time algorithm for finding the shortest
polygonal chain in a simple polygon such that each point of the
polygon is visible from some point on the chain. This chain is called
the shortest watchman path, or equivalently, the shortest weakly
visible curve of the polygon. This problem has been believed to be
NP-hard.
.LP
As an introduction we will survey some problems, on guarding with mobile
guards, that are easy to formulate but whose solutions are not. We
show both negative and positive results for this kind of problems.
8. Lab Cleanup (till 2:30pm or 5 minutes, whichever is longer)