Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watmath.UUCP
Path: utzoo!watmath!mwang
From: mwang@watmath.UUCP (mwang)
Newsgroups: ont.events
Subject: UW DS Semi., Dr. Widmayer on "Shortest Orthogonal Connections ...".
Message-ID: <199@watmath.UUCP>
Date: Thu, 21-Nov-85 12:35:49 EST
Article-I.D.: watmath.199
Posted: Thu Nov 21 12:35:49 1985
Date-Received: Sat, 23-Nov-85 00:14:21 EST
Expires: Tue, 26-Nov-85 00:00:00 EST
Organization: U of Waterloo, Ontario
Lines: 27


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

DATA STRUCTURING SEMINAR

                    - Tuesday, November 25, 1985.

Dr. Peter Widmayer of Universitat will speak on ``Shor-
test  Orthogonal  Connections  with  Orthogonal  Obsta-
cles''.

TIME:                12:30 PM

ROOM:              MC 5158

ABSTRACT

Consider  a  set  of  points in the plane, and a set of
obstacles.   The  obstacles  are  polygons  with  edges
parallel  to  the  coordinate axes.  A path between two
points  consists of line segments parallel to the coor-
dinate  axes, and it is not allowed to pass through any
obstacle.   We  now  have to find shortest paths from a
point  to all others, and how to compute a minimum tree
for the set of points.