Meeting Agenda - 2000.05.10

May 10th, 2000

Location:

DC1304

Time:

1:30 p.m.

Chair:

Kevin Moule

1. Adoption of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour last week:

Rob Kroeger

Coffee hour this week:

Jason Ang

Coffee hour next week:

???

3. Next meeting

Date:

Wednesday, May 17th, 2000

Location:

DC1304

Time:

1:30 p.m.

Chair:

Chris O'Sullivan

Technical presentation:

Jasmin Patry

4. Forthcoming

Chair:

1. Jasmin Patry (May 24th)
2. Selina Siu (May 31st)
3. Mauro Steigleder (June 7th)

Tech Presenters:

1. Mike McCool (May 24th)
2. Kevin Moule (May 31st)
3. Chris O'Sullivan (June 7th)

5. Technical Presentation

Presenter:

Vincent Ma  

Title:

Real-time perspective-correct silhouette edge generation.

Abstract:

In this tech talk I will discuss the theory behind an algorithm that determines, in real time, the perspective-correct silhouette edge set of a simple non-convex polytope with respect to a particular viewpoint. I will also cover implementation issues that arose during my implementation of this algorithm, and future work that will improve the algorithm.

6. General Discussion Items

• Survey says, the 1:30 time is good
• We need some more backup tapes
• C.O.R.E. is interested in collaboration---see Tim Lahey
• New lab members: Mike Chen and Mark Zadel

7. Action List

• Grant applications to USENIX conference; see Robyn Landers rblanders@math, and http://www.math/~rblander/usenix.
• Graphics Interfaces Conference: May 15-17, Montreal.
• SIGGRAPH early registration is June 16th

8. Director's Meeting

• Hartmut Schirmacher's talk

9. Seminars

• Friday May 12th 2000, MC5158 @ 3:30
  Combinatorics and Optimization
  The Tutte Matrix and matroid matching
  Jim Geelen
  

  Tutte associates a skew--symmetric matrix $T$, having indeterminate entries, with a graph. The rank of Tutte's matrix is exactly twice the size of a maximum cardinality matching in the graph. This observation led Tutte toward a proof of his famous matching theorem. We consider the problem of determining the rank of $T+K$, where $K$ is a skew--symmetric matrix with rational entries. This modest generalization of the matching problem contains the linear matroid matching problem. We revisit Tutte's techniques, from half a century ago, to prove a min--max formula for this more general problem.