clarke@utcsri.UUCP (10/15/87)
(SF = Sandford Fleming Building, 10 King's College Road)
SUMMARY:
COMBINATORICS SEMINAR, Monday, October 19, 3 pm, SF1102 -- Adrian Bondy:
"Double Covers of Graphs"
COLLOQUIUM, Tuesday, October 20, 11 am, SF1105 -- Alain Fournier:
"Modelling Natural Phenomena in Computer Graphics"
-----------------------------
COMBINATORICS SEMINAR, Monday, October 19, 3 pm, SF1102
Professor Adrian Bondy
University of Waterloo
"Double Covers of Graphs"
The circuits which bound the faces of a 2-edge-connected plane graph have
the property that each edge of the graph lies in exactly two of them. Such
a collection of circuits is called a circuit double cover of the graph. The
Circuit Double Cover Conjecture, due to Paul Seymour, asserts that every
2-edge-connected graph admits a circuit double cover. We propose a refine-
ment of Seymour's conjecture, the Strong Circuit Double Cover Conjecture,
and discuss its implications.
COLLOQUIUM, Tuesday, October 20, 11 am, SF1105
Professor Alain Fournier
University of Toronto
"Modelling Natural Phenomena in Computer Graphics"
Natural phenomena present a particular challenge to modelling in computer
graphics. They are complex, numerous and we are very good at recognizing
them. I will present a survey and evaluation of the approaches used to meet
that challenge and compare them to modelling techniques in other areas. I
will use the modelling of some aspects of waves on the surface of the ocean
as a case study.
--
Jim Clarke -- Dept. of Computer Science, Univ. of Toronto, Canada M5S 1A4
(416) 978-4058
{allegra,cornell,decvax,linus,utzoo}!utcsri!clarke