SCHEDULE OF TALKS



Friday, October 27, 2000

8:45: Coffee and donuts

[Session Chair: Joe Mitchell]
 9:00 - 10:00 invited talk: Ari Kaufman
  Volume Graphics
10:00 - 10:20 
  The Power Crust, Unions of Balls and the Medial Axis Transform,
  Nina Amenta, Sunghee Choi, and Ravi Krishna Kolluri
10:20 - 10:40 talk
  External Memory View-Dependent Simplification and Rendering,
  Jihad El-Sana and Yi-Jen Chiang

10:40 - 11:00 coffee break

[Session Chair: Roberto Tamassia]
11:00 - 11:20
  Occlusion Culling for Fast Walkthrough in Urban Areas,
  Pankaj K. Agarwal, Sariel Har-Peled, and Yusu Wang
11:20 - 11:40
  4D Data Visualization Using Isosurfaces and a Control Plane, 
  Lutz Kettner, Jarek Rossignac, and Jack Snoeyink
11:40 - 12:00
  Visualizing Geometric Algorithms with WAVE: System Demonstration,
  Camil Demetrescu, Emilio Di Giacomo, Irene Finocchi, Giuseppe Liotta
12:00 - 12:20
  Hardware Assisted View-Dependent Map Simplification,
  Nabil Mustafa, Elefterios Koutsofias, Shankar Krishnan, and 
  Suresh Venkatasubramanian
12:20 - 12:40
  Safe Sets for Line Simplification,
  Andrea Mantler and Jack Snoeyink

12:40 - 2 lunch (Deli style)

[Session Chair: Steve Skiena]
2:00 - 3:00 invited talk: Micha Sharir
  Combinatorics of arrangements - recent progress
3:00 - 3:20
  Geometric Permutation of High Dimensional Spheres,
  Yingping Huang, Jinhui Xu, and Danny Z. Chen
3:20 - 3:40 
  On the Number of Views of Polyhedral Scenes,
  Boris Aronov, Herv\'{e} Br\"{o}nnimann, Yi-Jen Chiang, Dan Halperin,
  and Robert Schiffenbauer

3:40 - 4:00 coffee break

[Session Chair: Sariel Har-Peled]
4:00 - 4:20 
  Polygonal Path Approximation with Angle Constraints,
  Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter Kogge, 
  and Jack Snoeyink
4:20 - 4:40 
  Optimal Planar Point Location,
  John Iacono
4:40 - 5:00 
  An Efficient Algorithm for Enumeration of Triangulations,
  Sergei Bespamyatnikh
5:00 - 5:20
  On the Planar Two-Watchtower Problem
  Kanliang Wang and Binhai Zhu

[Session Chair: Joe Mitchell]
5:30 - 6:30 open problem session

6:30  Dinner at local restaurants



Saturday, October 28, 2000

8:45: Coffee and donuts

[Session Chair: Estie Arkin]
 9:00 - 10:00 invited talk: Ileana Streinu
  Folding carpenter's rulers, robot arms, proteins: a
    rigidity theoretic approach
10:00 - 10:20 
  When Can You Fold a Map?,
  Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine,
  Joseph S. B. Mitchell, Saurabh Sethia, and Steven S. Skiena
10:20 - 10:40 
  A Fast Multi-Dimensional Algorithm for Drawing Large Graphs,
  Pawel Gajer, Michael T. Goodrich, and Stephen G. Kobourov

10:40 - 11:00 coffee break

[Session Chair: Michael Bender]
11:00 - 11:20
  PRECISE: Efficient Multiprecision Evaluation of Algebraic Roots and
  Predicates for Reliable Geometric Computations,
  Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, and Dinesh Manocha
11:20 - 11:40
  Recent Developments in Core Library,
  Chee K. Yap and Chen Li
11:40 - 12:00
  I/O Efficient Well-Separated Pair Decomposition and its Applications,
  Sathish Govindarajan, Tam\'{a}s Lukovszki, Anil Maheshwari, and Norbert Zeh
12:00 - 12:20
  Separation Sensitive Kinetic Collision Detection for Simple Polygons,
  David Kirkpatrick and Bettina Speckmann
12:20 - 12:40
  A Near-Linear Algorithm for Curve Simplification,
  Pankaj K. Agarwal, Sariel Har-Peled, and Nabil H. Mustafa

12:40 - 1:40 lunch (pizza)

[Session Chair: Erik Demaine]
1:40 - 2:40 invited talk: George Hart
  Sculpture Based on Propellorized Polyhedra 
2:40 - 3:00
  On the Reflexivity of Point Sets,
  Esther M. Arkin, S\'andor P. Fekete, Ferran Hurtado, 
  Joseph S. B. Mitchell, Marc Noy, Vera Sacrist\'an, and Saurabh Sethia
3:00 - 3:20
  Volume Queries in Polyhedra,
  John Iacono and Stefan Langerman

3:20 - 3:40 coffee break

[Session Chair: Saurabh Sethia]
3:40 - 4:00
  Efficient Computation of Proximity Graphs, 
  Ferran Hurtado, Giuseppe Liotta and Henk Meijer
4:00 - 4:20
  Polynomially Fast Parallel Algorithms for Some P-Complete Geometric
  Problems, Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara
4:20 - 4:40
  Optimal Steiner Hull Algorithm,
  Pawel Winter
4:40 - 5:00
  An $O(N^2)$ Sausage Heuristic for Determining Steiner Minimal Trees in $E^3$,
  Toppur N. Badri and J. MacGregor Smith
                                                  
5:00 End of workshop


Sponsored by the Department of Applied Mathematics and Statistics and
the Department of Computer Science and Engineering, State University
of New York at Stony Brook, with partial support from the National
Science Foundation and Salomon Smith Barney.