Second CGC Workshop on
Computational Geometry

Program and Abstracts

Saturday, October 18

08:15		Breakfast
08:45		Opening remarks
09:00		Jonathan Cohen, Dinesh Manocha, and Marc Olano Simplifying Polygonal Models Using Successive Mappings [Full paper]
09:15		Steven Fortune Vertex-Rounding a Three-Dimensional Polyhedral Subdivision [Full paper]
09:30		Gill Barequet, Danny Chen, Ovidiu Daescu, and Michael T. Goodrich Efficiently Approximating Polygonal Paths in Three Dimensions
09:45		Short break
09:55		Invited Talk: Phil Emmerman Advanced Battlefield Processing
10:45		Coffee break
11:15		Nilo Stolte and Arie Kaufman Discrete Implicit Surface Models using Interval Arithmetics [Full paper]
11:30		Cláudio Silva and Joe Mitchell Lazy Sweep Ray Casting: A Fast Scanline Algorithm for Rendering Irregular Grids
11:45		John Keyser, Shankar Krishnan, and Dinesh Manocha Efficient and Accurate B-rep Generation of Low Degree Sculptured Solids Using Exact Arithmetic
12:00		Invited Talk: Ken Fast Some Issues Facing Commercial End-Users of Large-Scale CAD Visualization
12:30		Lunch
02:00		Piotr Berman and Bhaskar DasGupta On Approximating the Corner Cover Problem [Full paper]
02:15		Jan Vahrenhold and Klaus H. Hinrichs Fast and Simple External-Memory Planar Point-Location [Full paper]
02:30		Yi-Jen Chiang and Cláudio T. Silva I/O Optimal Isosurface Extraction in Scientific Visualization [Full paper]
02:45		Hassan Karimi Optimal Routing Algorithms in Geographic Information Systems (cancelled)
03:00		Short break
03:10		Invited Talk: Chris Hoffmann Geometric Constraint Solving
04:00		Coffee break
04:30		Bryan Cook, Lydia E. Kavraki, and Rajeev Motwani Efficient Clustering of Molecular Conformations
04:45		Sylvain Lazard Shortest Paths of Bounded Curvature in a Convex Polygon
05:00		Karl-Friedrich Böhringer, Bruce Randall Donald, and Dan Halperin On the Area Bisectors of a Polygon [Full paper]
05:15		Moses Charikar, Dan Halperin, and Rajeev Motwani The Dynamic Servers Problem
05:30		Adjourn for dinner

Sunday, October 19

08:30		Breakfast
09:00		Invited Talk: Paul Tanenbaum Applications of Computational Geometry in Army Research and Development
09:50		Short break
10:00		Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, and Santosh Vempala Locality-Preserving Hashing in Multidimensional Spaces [Full paper]
10:15		Christos Levcopolous, Giri Narasimhan, and Michiel Smid Fault-Tolerant Spanners
10:30		David M. Mount and Sunil Arya ANN: A Library for Approximate Nearest Neighbor Searching
10:45		Coffee break
11:15		David Eppstein and Marshall Bern Quadrilateral Meshing by Circle Packing [Full paper]
11:30		Gregory S. Chirikjian Recursive Semi-Regular Circle Packings on the Sphere
11:45		Thomas Fevens, Henk Meijer, and David Rappaport Minimum Weight Convex Quadrilateralization of a Constrained Point Set [Full paper]
12:00		Lunch
01:30		Invited Talk: Seth Teller Application Models and Challenges for Computational Geometry
02:20		Short break
02:30		Therese C. Biedl The Three-Phase Method and Applications [Full paper]
02:45		Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, and Luca Vismara Interactive Orthogonal Graph Drawing [Full paper]
03:00		Konstantinos G. Kakoulis and Ioannis G. Tollis An Algorithm for Labeling Edges of Hierarchical Drawings [Full paper]
03:15		Gill Barequet, Matthew T. Dickerson, and Robert L. Scot Drysdale On 2-Point Site Voronoi Diagrams
03:30		Coffee break
04:00		Li Zhang, Harish Devarajan, Julien Basch, and Piotr Indyk Probabilistic Analysis for Combinatorial Functions of Moving Points
04:15		Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian Geometric Matching under Noise: Combinatorial Bounds and Algorithms
04:30		Iosif I. Vaisman, Alexander Tropsha, and Weifan Zheng Tessellated Molecules: Computational Geometry of Chemical and Biological Structure
04:45		Closing remarks