MSRI Workshop on Computational Geometry

Pankaj Kumar Agarwal pankaj at cs.duke.edu
Wed Sep 24 23:52:48 PDT 2003


	Workshop on the Mathematical Foundations of Geometric Algorithms
			MSRI, October 13--17, 2003


TENTATIVE PROGRAM
-----------------

Monday, October 13
------------------

9:00 - 10:00     David Mount, University of Maryland,
                 Approximate Voronoi diagrams

10:00- 10:30     Tea

10:30- 11:00     TBA

11:00- 11:30     Jonathan Shewchuk, UC Berkeley,
                 Anisotropic Voronoi diagrams and guaranteed-quality 
                 anisotropic mesh generation

11:30- 12:00     Jack Snoeyink, University of North Carolina,
	         Pragmatic point ordering for Delaunay tessellation in 3D and 4D 

12:00- 2:00      Lunch

2:00 - 2:30      Nina Amenta, UC Davis, 
                 Smooth surfaces from point clouds

2:30 - 3:15      Subhash Suri, UC Santa Barbara,
		 Problems on the interface of geometry and economics

3:15 - 3:45      Tea

4:15 - 5:15      Herbert Edelsbrunner, Duke University,
		 PL implementations of differential topology concepts 
		 and their applications
	 	 (MSRI-Evans Talk, at Evans Hall)


Tuesday, October 14
-------------------

9:00 - 10:00     Pankaj Agarwal, Duke University, 
		 Geometric approximation using core sets

10:00- 10:30     Tea

10:30- 11:00     Sariel Har-Peled, UIUC,
		 On core sets and shape fitting in high dimensions

11:00- 11:30     Joseph S.B. Mitchell, SUNY at Stony Brook,
                 On some geometric optimal path and network problems

11:30- 12:00     Leonidas J. Guibas, Stanford University,
                 What is new with kinetic data structures?

12:00- 2:00      Lunch

2:00 - 3:00      Dan Halperin, Tel Aviv University,
                 Exact, rounded, or perturbed: 
                 How would you like your arrangements?

3:00 - 3:30      Tea

3:30 - 4:30      Vladlen Koltun, MSRI,
                 Arrangements of surfaces:  A state of the art report


Wednesday, October 15
---------------------

9:00 - 10:00     Bernd G\"artner, ETH Z\"urich,
                 Linear algebra and LP-type problems

10:00- 10:30     Tea

10:30- 11:00     Marie-Francoise Roy, Universit\'e de Rennes,
                 Bernstein basis and real rool isolation.

11:00- 11:30     Thorsten Theobald, TU Muenchen,
		 Computational complexity of stabbing, visibility 
		 and radii computations

11:30- 12:00     Boris Aronov, Polytechnic University, 
		 Efficient algorithms for bichromatic separability


1:00 -           Outing


Thursday, October 16
--------------------

9:00 - 10:00     Santosh Vempala, MIT, 
                 How to compute the volume?

10:00- 10:30     Tea

10:30- 12:00     Open Problem Session

12:00- 2:00      Lunch

2:00 - 2:30      Kasturi Varadarajan, University of Iowa,
                 Bipartite perfect matching in the plane

2:30 - 3:00      Yusu Wang, Duke University,
		 Capturing topological and geometric features of
		 molecular surfaces for protein docking

3:00 - 3:30      Tea

3:30 - 4:30      Patrice Koehl, Stanford University,
		 Protein shape descriptors


Friday, October 17
------------------

9:00 - 10:00     Timothy Chan, University of Waterloo,
                 Approximation algorithms for diameter, width,
		 and related problems

10:00- 10:30     Tea

10:30- 11:00     Shakhar Smorodinsky, MSRI,
                 On conflict-free colorings

11:00 -11:30     Uli Wagner, MSRI,
                 Learning about manifolds from samples

11:30- 2:00      Lunch

2:00 - 3:00      Bernard Chazelle, Princeton University,
                 Geometric computing with uncertain, missing, 
                 or overabundant data

3:00 - 3:30      Tea

3:30 - 4:00      Eti Ezra, Tel Aviv University,
		Output-sensitive construction of the union of triangles

4:00 - 4:30      Yi-Jen Chiang, Polytechnic  University,
		 Progressive simplification of tetrahedral meshes 
	         preserving all isosurface topologies

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.



More information about the Compgeom-announce mailing list