MEETING-DATE:December 15, 2011
MEETING-LOCATION:DC 1331
MEETING-TIME:11:30
MEETING-CHAIR:Matei Negulescu
MEETING-CHAIRPIC:matei.png
COFFEE-HOUR-LAST-WEEK:Simon
COFFEE-HOUR-THIS-WEEK:Volunteers?
COFFEE-HOUR-NEXT-WEEK:Volunteers?
FORTH-DATE1:December 22, 2011?
FORTH-DATE2:January 5, 2012
FORTH-DATE3:January 12, 2012
FORTH-DATE4:January 19, 2012
FORTH-LOCATION1:DC 1331 11:30
FORTH-LOCATION2:DC 1331 11:30
FORTH-LOCATION3:DC 1331 11:30
FORTH-LOCATION4:DC 1331 11:30
FORTH-CHAIR1:Alex Pytel
FORTH-CHAIR2:Mike Terry 
FORTH-CHAIR3:Matthew Thorne
FORTH-CHAIR4:Dan Vogel
FORTH-CHAIRPIC1:apytel1.jpg
FORTH-CHAIRPIC2:mterry.jpg
FORTH-CHAIRPIC3:thorne.jpg
FORTH-CHAIRPIC4:nohs.gif
FORTH-TP1:Matei Negulescu
FORTH-TP2:Simon Parent
FORTH-TP3:Alex Pytel
FORTH-TP4:Michael Terry
FORTH-TPPIC1:matei.png
FORTH-TPPIC2:Simon2.png
FORTH-TPPIC3:apytel1.jpg
FORTH-TPPIC4:mterry.jpg
TPNAME:Stephen Mann
TPTITLE:Shaded Concave Polygons: Mean Value Coordinates
TPABSTRACT:Gouraud shading of triangles is straightforward: you compute the barycentric coordinates of an interior point and use those to weight the colour values at the corners of the polygon.  However, it is unclear how to do Gouraud shading of general polygons.  In this talk, I will discuss using Mean Value Coordinates as a method to Gouraud shade general polygons.
TPPIC:smann-3.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:Book meeting room for next term.
AITWO:
AITHREE:
AIFOUR:
DMONE:
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<pre><nl>    2011 Dec 14, 11:30 - Algorithms and Complexity Group Master's Essay Presentation<nl>    Nik Shkrob, graduate student, David R. Cheriton School of Comp. Sci., Univ. Waterloo Integer representation: n-ary Gray codes in the cell probe memory model<nl></pre><nl><pre><nl>    2011 Dec 15, 10:00 - Cryptography, Security, and Privacy (CrySP) Group Master's Thesis Presentation<nl>    Rob Smits, graduate student, David R. Cheriton School of Comp. Sci., Univ. Waterloo<nl>    BridgeSPA: A Single Packet Authorization Sytem for Tor Bridges<nl></pre><nl><pre><nl>    2011 Dec 16, 15:30 - Computer Science Seminar<nl>    David C. Parkes, Harvard University<nl>    Mechanism Design through Monotone Branch-and-Bound Search<nl></pre><nl>