Meeting Agenda- 1999.10.20
October 20, 1999
-
Location:
-
DC 1304
-
Time:
-
1:30 p.m.
-
Chair: Jasmin Patry
![:-]](Images/jfpatry.jpg)
Member
List
1. Adoption of the Agenda - additions or deletions
2. Coffee Hour
-
Coffee hour this week:
-
Jason
-
Coffee hour next week:
-
??
3. Next meeting
-
Date:
-
Wednesday, October 27th, 1999.
-
Location:
-
DC1304
-
Time:
-
1:30 p.m.
-
Chair:
-
Pascale Proulx
-
Technical presentation:
-
Jasmin Patry
4. Forthcoming
Chair:
-
Chris O'Sullivan (November 3rd)
-
Mark Riddell (November 10th)
-
Selina Siu (November 17th)
-
Tech Presenters:
-
Pascale Proulx
-
Chris O'Sullivan (November 10th)
-
Mark Riddell (November 17th)
5. Technical Presentation
-
Presenter:
-
Joanne McKinley
-
Title:
-
Event Handling in Java Applications
-
Abstract:
-
Since its introduction in late 1995, Java has been widely praised as
having many features that make it well-suited for programming in today's
networked, heterogeneous world. Java's promise (intention?) of "write
once, run anywhere" has sparked much interest and excitement among
graphical user interface (GUI) programmers, as GUIs have traditionally
been among the most difficult applications to port to different platforms.
-
With the introduction of the Swing UI toolkit as an integral part of Java
Development Kit (JDK) 1.2, Java GUIs have become even faster and easier to
develop. I will briefly introduce these Swing components, but the main
portion of my talk will involve event handling and the event-handling
thread in Java GUI applications. You will learn how to implement your own
event handlers, but more importantly, you will gain a better understanding
of the underlying architecture employed to handle events and the
implications it has on your own Java GUI applications.
6. General Discussion Items
7. Action List
-
Don't forget about OGS scholarships. Jane Prime has the applications (DC2332).
Departmental deadline: Tuesday, October 26, 1999
In the past, Jane has taken Tuesdays as a day off, so plan to submit
earlier, if possible.
-
John Hart is visiting on October 26th.
-
GI deadline Nov. 19. This time it will be in Montreal.
-
The SIGGRAPH 2000 is deadline Jan. 12.
-
Bill is collecting ideas for lab improvements, like things to buy for the
lab.
-
DGP Visit: to be organized with DGP.
8. Director's Meeting
9. Seminars
Modelling Hysteresis for Fabric Simulation
by Tim Lahey, MASc candidate
Abstract:
Woven fabric is used for more than just clothing. Fabric is sometimes
used as a construction material in domes, in airbags for cars, in
parachutes, and in spacesuits. Even some composite materials use a
woven structure. An accurate mechanical model that can reproduce the
behaviour of woven fabric when subjected to stresses is necessary to
simplify the design process for the above areas.
In addition to the above, people in computer graphics also have an
interest in the simulation of fabric behaviour. Several models
predicting the drape and/or dynamic response of fabric have been
developed in the past five years. There are shortcomings to the
previous research. Currently, most of the mechanical models of fabric
used in simulations of fabric behaviour, (e.g., fabric drape) do not
account for the hysteresis or "memory" effect apparent in fabric's
mechanical response. This thesis proposes a mechanical model that can
reproduce the stress-strain behaviour of the fabric as shown in
tension, shear, and bending plots. It also addresses multi-axial
stress states when both normal and shear stresses exist.
To show the utility of the model and to provide a comparison showing
the affect of the inclusion of the hysteresis into a simulation, a
lumped mass model of fabric is simulated with the hysteresis model
governing the interactions between the masses. This result is compared
to a simple lumped mass model that assumes linear behaviour for
tension, shear, and bending. While more sophisticated models exist,
the linear spring-mass model is relatively common in the computer
graphics literature and the assumptions of linearity
are typical.
Date: Wednesday October 20, 1999
Time: 11:30 am
Location: E2-1307C
Supervisors: Professors Heppler (SyDe) and Bartels (CS)
Readers: Professors McPhee (SyDe) and Plumtree (ME)
COMPUTER SCIENCE SEMINAR
Pleases note change! -Thursday, October 21, 1999
Peter van Beek, Department of Computing Science,
University of Alberta, will speak on ``Constraint
Programming for Scheduling, Sequencing, and Planning''.
TIME: 10:30-11:30 a.m
ROOM: DC 1304
ABSTRACT
Constraint programming is a methodology for solving
difficult combinatorial problems. A problem is modeled
as a set of variables, a domain of values for each
variables. A solution is an instantiation of the
variables that satisfies the constraints. In spite of
the simplicity of the framework, it is applicable to
many diverse and interesting problems, ranging from
ones that are simple for humans, such as vision and
language comprehension, to ones that are difficult for
humans, such as scheduling. In this talk, I will review
the techniques for formulating and solving problems
using constraint programming and then discuss my recent
work on understanding what makes a good constraint
programming model for a problem, with particular
attention to scheduling, sequencing, and planning
problems.
Biographical sketch
Peter van Beek received his PhD in 1990 from the
University of Waterloo and at that time joined the
Department of Computing Science at the University of
Alberta where he is now a Professor and Associate Chair
(Undergraduate). He is on the editorial boards of three
journals and he has served on the program committees of
many conferences and workshops. In 1992, a paper he
wrote was awarded honorable mention in the best written
paper competition at the National Conference of the
American Association for Artificial Intelligence. In
1995, a paper he co-authored won an Outstanding Paper
Award at the International Joint Conference on
Artificial Intelligence.
Combinatorics and Optimization
Colloquium
Friday, 22 October 1999 at 3:30PM
Math & Computer, Room 5158
-------
Tutte Colloquium - Hall's Theorem on hypergraphs
Prof. Penny Haxell
Dept. of Combinatorics & Optimization, University of Waterloo
ABSTRACT
For a complete abstract, please visit our website.
For Additional Information, Contact:
URL: http://www.math.uwaterloo.ca/CandO_Dept/Seminars/upcoming.html
** EVENT NOTICE **
Combinatorics and Optimization
Seminar
Monday, 25 October 1999 at 3:30PM
Math & Computer, Room 5136
-------
Cryptography Seminar - Certification of secure RSA keys
Steven Galbraith
Dept. of Combinatorics & Optimization, University of Waterloo
ABSTRACT
For a complete abstract, please visit our website.
For Additional Information, Contact:
URL: http://www.math.uwaterloo.ca/CandO_Dept/Seminars/upcoming.html
Institute for Computer Research
Presents a Seminar on
The Quest for Procedural Texturing and Shading in Graphics Hardware
By: Dr. John C. Hart
Of: School of EECS
Washington State University
Date: Tuesday, October 26, 1999
Time: 1:30 p.m.
Place: Davis Centre, Room 1304
Abstract Procedural solid texturing was introduced fourteen years ago,
but has yet to find its way into consumer level graphics hardware for
real-time operation. The fundamental problems have been the design of
special graphics hardware for executing texturing and shading
procedures, the specification of these procedures through a graphics
library for hardware execution, and the antialiasing of the resulting
generated textures.
As a first step to show the feasibility of procedural solid texturing
hardware, we introduce a new model that yields a parameterized
function capable of synthesizing the most common procedural solid
textures, specifically wood, marble, clouds and fire. This model is
simple enough to be implemented in hardware, using as little as 10% of
current graphics chip real estate. The parameters of the function
provide a concise procedural texture specification, and the resulting
texture is antialiased using a filter width derived by differentiating
the function with respect to screen coordinates.
Biography John C. Hart is an Associate Professor in the School of
Electrical Engineering and Computer Science at Washington State
University, and Interim Director of the Image Research Laboratory.
Hart's research in computer graphics focuses on procedural modeling
and texturing. For example: Procedural Geometric Instancing is a scene
description language developed, with funding from Intel and the NSF,
to support the procedural specification of complex scenes, Antialiased
Parameterized Solid Texturing is a hardware design and API
specification created, with funding by Evans & Sutherland and the
Washington Technology Center, for real time procedural texturing, and
Implicit Surfaces, which are defined procedurally as zero-sets of real
functions over space. The connectedness of procedural models such as
implicit surfaces is currently difficult to control. Hence Hart
working, with funding from the NSF, on applications of computational
topology to computer graphics, developing algorithms and data
structures to understand, interrogate and control the connectedness of
shapes used in computer graphics. He also works with Wayne Cochran on
Recurrent Modeling, which uses fractal geometry to procedurally model
real-world shape data, such as terrain. He also collaborates with
Keith Dunker on deformation techniques for visualizing protein
structure. Hart received his B.S. in Computer Science from Aurora
University, and his M.S. and Ph.D. in Computer Science from the
University of Illinois at Chicago. There, he worked as a research
assistant in the Electronic Visualization Laboratory, and in 1992, as
a postdoctoral research associate jointly with the National Center for
Supercomputing Applications. As a graduate student, he interned
summers in Alan Norton's group at the IBM T.J. Watson Research Center,
and at AT&T Pixel Machines (R.I.P.). He has consulted for
Kleiser-Walczak on an animation project for the Luxor Hotel, Las
Vegas, for Evans & Sutherland, Inc., on graphics hardware, and for
VIFX on implicit surface software for movie special effects. Hart
served on the ACM SIGGRAPH Executive Committee from 1994 to 1999. With
Carl Machover, he was an Executive Producer for "The Story of Computer
Graphics," a SIGGRAPH Studios documentary coming soon to a theater
near you. He served on the program committee for Implicit Surfaces 99,
and currently for IEEE VR2000.
Invited by
Professor Michael McCool Department of Computer Science
Everyone is welcome. Refreshments served.
ICR gratefully acknowledges the support of its Corporate Members for
this Seminar Series: Bell Canada, DALSA Inc. and NCR Canada Limited.
Visit our web site at http://icr.uwaterloo.ca for the latest news on
events sponsored by ICR.
10. Lab Cleanup