MEETING-DATE:Dec 17, 2007
MEETING-LOCATION:DC 1331
MEETING-TIME:1:30
MEETING-CHAIR:Curtis Luk
MEETING-CHAIRPIC:cluk.jpg
COFFEE-HOUR-LAST-WEEK:?
COFFEE-HOUR-THIS-WEEK:?
COFFEE-HOUR-NEXT-WEEK:?
FORTH-DATE1:Jan 9
FORTH-DATE2:Jan 16
FORTH-DATE3:Jan 23
FORTH-DATE4:Jan 30
FORTH-LOCATION1:DC 1331 1:30
FORTH-LOCATION2:DC 1331 1:30
FORTH-LOCATION3:DC 1331 1:30
FORTH-LOCATION4:DC 1331 1:30
FORTH-CHAIR1:Terry Park
FORTH-CHAIR2:Alexander Pytel
FORTH-CHAIR3:Zheng Qin
FORTH-CHAIR4:Jaime Ruiz
FORTH-CHAIRPIC1:Shrank.jpg
FORTH-CHAIRPIC2:Shrank.jpg
FORTH-CHAIRPIC3:zqin.jpg
FORTH-CHAIRPIC4:jaimeruiz.jpg
FORTH-TP1:Robin Liu
FORTH-TP2:Yi Lin
FORTH-TP3:Terry Park
FORTH-TP4:Alexander Pytel
FORTH-TPPIC1:ybliu.jpg
FORTH-TPPIC2:y9lin.jpg
FORTH-TPPIC3:Shrank.jpg
FORTH-TPPIC4:Shrank.jpg
TPNAME:Curtis Luk
TPTITLE:Subdivision Surfaces for Fast Subdivision Surfaces for Fast Approximation of Implicit Surfaces

TPABSTRACT:A method is proposed for quickly tesselating implicit surfaces.  Using voxel root finding and subdivision surface construction schemes, a reasonable and aesthetically "accurate" result can be obtained.
TPPIC:cluk.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:
AITWO:
AITHREE:
AIFOUR:
DMONE:
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<ul class="space"<nl>><li<nl>><a href="572"<nl>>2007 Dec 19</a<nl>>, 10:30 — Software Engineering Research Group Master's Essay Presentation<br<nl>>Walid Koleilat, graduate student, David R. Cheriton School of Comp. Sci., Univ. Waterloo<br<nl>>ArcRule: Enforcing Architecture Conformance using AOP and JGrok.</li<nl>><li<nl>><a href="573"<nl>>2007 Dec 19</a<nl>>, 13:30 — Algorithms and Complexity Group Seminar<br<nl>>Mark Petrick, School of Computer Science, University of Waterloo <br<nl>>Morphing Planar Graph Drawings with Bent Edges</li<nl>><li<nl>><a href="566"<nl>>2008 Jan 16</a<nl>>, 13:30 — Algorithms and Complexity Group PhD Seminar<br<nl>>Eric Y. Chen, PhD candidate, David R. Cheriton School Comp. Sci., Univ. Waterloo<br<nl>>In-Place 2-D Nearest Neighbor Search</li<nl>><li<nl>><a href="574"<nl>>2008 Jan 21</a<nl>>, 13:30 — Algorithms and Complexity Group Seminar<br<nl>>Gwenael Richomme, University of Picardie Jules Verne, France,<br<nl>>Quasiperiodic Sturmian and episturmian words</li<nl>></ul<nl>><nl>