All talks will be given in the Lubrano Conference room, 4th floor CIT (directions).
09:00 | Invited Talk: Chee Yap
A new Number Core for Robust Numerical and Geometric Libraries. [Abstract] |
10:00 | Short break |
10:10 | Kasturi R. Varadarajan.
A divide-and-conquer algorithm for min-cost perfect matching in the plane. [Abstract] |
10:30 | Christian A. Duncan, Michael T. Goodrich and Stephen Kobourov.
Balanced Aspect Ratio Trees: An Introduction. [Abstract] |
10:50 | Coffee break (Fourth floor atrium, CIT ) |
11:20 | Jack Snoeyink.
Queries with Segments in Voronoi Diagrams. [Abstract] |
11:40 | Evanthia Papadopoulou and D.T. Lee.
L_infinity Voronoi diagrams and applications in VLSI Layout and Manufacturing. [Abstract] |
12:00 | Waldir L. Roque and Howie Choset.
The Green Island Formation in Forest Fire Modeling with Voronoi Diagrams. [Abstract] |
12:20 | Lunch (Fourth floor atrium, CIT ) |
1:30 | Invited Talk: Joe Marks
Graphics Made easier (Through Computational Geometry and Optimization). [Abstract] |
2:30 | Short break |
2:40 | Ulrike Axen.
Computing Morse Functions on Triangulated Manifolds. [Abstract] |
3:00 | Vasiliki Chatzi.
Finding Basis Functions for Pyramidal Finite Elements. [Abstract] |
3:20 | Coffee break (Fourth floor atrium, CIT ) |
3:50 | Jean-Daniel Boissonnat and Franco P. Preparata.
Robust plane sweep for intersecting segments. [Abstract] |
4:10 | Nina Amenta, Marshall Bern, David Eppstein and Shang-Hua Teng.
Regression Depth and Center Points. [Abstract] |
4:30 | Rex A. Dwyer.
Voronoi Diagrams on Random Moving Points. [Abstract] |
4:50 | Reception (Fifth floor, CIT ) |
09:00 | Invited Talk: Jadgish Chandra
Intelligent systems for distributed information processing |
10:00 | Short break |
10:10 | Yi-Jen Chiang and Claudio T. Silva.
External Memory Techniques for Isosurface Extraction in Scientific Visualization. [Abstract] |
10:30 | Subodh Kumar.
Incremental PSLG Triangulation for Surface Rendering. [Abstract] |
10:50 | Coffee break (Fourth floor atrium, CIT ) |
11:20 | Christian A. Duncan, Michael T. Goodrich and
Stephen G. Kobourov.
Balanced Aspect Ration Trees and Their Use for Drawing Very Large Graphs. [Abstract] |
11:40 | Stina Bridgeman, Giuseppe Di Battista, Walter Didimo,
Giuseppe Liotta, Roberto Tamassia and Luca Vismara.
Optimal Compaction of Orthogonal Representations. [Abstract] |
12:00 | Ashim Garg.
Interactive Graph Drawing Algorithms. [Abstract] |
12:20 | Lunch (Fourth floor atrium, CIT ) |
1:30 | Invited Talk: John Hughes
How Can Computational Geometry Matter to Computer Graphics? [Abstract] |
2:30 | Short break |
2:40 | Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi and Li Zhang.
Separation-Sensitive Collision Detection for Convex Objects. [Abstract] |
3:00 | Julien Basch, Jeff Erickson, Leonidas J. Guibas,
John Hershberger and Li Zhang.
Kinetic Collision Detection Between Two Simple Polygons. [Abstract] |
3:20 | Erik D. Demaine, Martin L. Demaine and Joseph S. B. Mitchell.
Folding any Silhouette from a Strip. [Abstract] |
3:40 | Coffee break (Fourth floor atrium, CIT ) |
4:10 |
Ala Eddine Barouni, Ali Jaoua and Nejib Zaguia.
Drawing Algorithms for Telecommunication Networks. Canceled. [Abstract] |
4:30 | Cao An Wang and Bo Ting Yang.
On Non Proximity-Drawbility of Maximal Planar Graphs. [Abstract] |
4:50 | Fujio Yamaguchi.
What is the Real Role of a Division Operation in a Computer-Aided Geometric Design System? [Abstract] |