Program

Friday, October 20, 1995

9:00

Invited talk: ``Geometry and visual learning'',

Stephen Omohundro, NEC Research Lab

9:45

``The restrict/evaluate/subdivide paradigm for translational containment'',

Karen Daniels

10:00

``Algorithms for minimizing overlap of translating polygons'',

Victor Milenkovic

10:15

Coffee Break.

10:45

``On triangulating three-dimensional polygons'',

Gill Barequet and Matthew Dickerson

11:00

``Choosing subsets with maximum weighted average'',

David Eppstein and Daniel Hirschberg

11:15

``A (usually) connected subgraph of the minimum weight triangulation'',

Matthew Dickerson and Mark Montague

11:30

Invited talk:

``Computational geometry problems in an integrated circuit design and layout tool'',

V.T. Rajan, IBM

12:15-1:30 pm

Lunch Break (Deli platter lunch will be provided)

1:30

Invited talk: ``Aspects of dimensional tolerancing'',

Chee Yap, New York University

2:15

Open Problem Session.

2:45

Coffee Break.

3:00

``New lower bounds for two problems in five dimensions'',

Jeff Erickson

3:15

``Rigid molecular docking by surface registration at multiple resolutions'',

Doug Ierardi and Seongbin Park

3:30

``On Hamiltonian triangulations in simple polygons'',

Giri Narasimhan

3:45

``Visibility in pseudo-polygons and vertex-edge pseudo-visibility graphs'',

Joseph O'Rourke and Ileana Streinu

4:00

``Visibility with multiple reflections'',

Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar P. Pal, and D. Chithra Prasad

4:15

Coffee Break.

4:30

``Incremental triangulation of trimmed spline surfaces'',

Subodh Kumar and Dinesh Manocha

4:45

``Efficient geometric algorithms for workspace orientation in 4- and 5-axis NC-machining'',

Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, and Tony Woo

5:00

``On the volume and resolution of 3-dimensional convex graph drawing'',

Marek Chrobak, Michael Goodrich, and Roberto Tamassia

5:15

``Drawing outerplanar minimum weight triangulations'',

William Lenhart and Giuseppe Liotta

5:30

``Recent results on 3D visibility representation of graphs'',

Sue Whitesides

5:45-8:00 pm

Dinner (small groups at local restaurants)

8:00 pm

Reception (At the home of Estie Arkin and Joe Mitchell, 5 Quintin Ct, Port Jefferson; 474-4301)

Saturday, October 21, 1995

9:00

Invited talk:

``Nearest neighbor searching, convexity, and interpolation'',

Ken Clarkson, Bell Labs

9:45

``Probabilistic algorithms for efficient grasping and fixturing'',

Marek Teichmann

10:00

``Paths among points inside a simple polygon'',

Marek Chrobak and Gopal Sundaram

10:15

``Generalized halfspaces in restricted-orientation convexity'',

Eugene Fink and Derick Wood

10:30

Coffee Break.

11:00

``A mathematical framework for sculptured solids in exact CSG representation'',

Jai Menon and Baining Guo

11:15

``Representation and evaluation of Boolean combinations of NURBS solids'',

Shankar Krishnan, Dinesh Manocha, and Atul Narkhede

11:30

``Quality pictures'',

Gregoria Blanco, Jesús García López, Ferran Hurtado, Pedro Ramos, and Vera Sacristán

11:45

``A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume'',

Scott Mitchell

12:00

``Regularity of set-theoretic representations in solid modeling'',

Vadim Shapiro

12:15-2:00 pm

Pizza and Software Demos

2:00

``An incremental algorithm for detecting interference between moving polyhedral models'',

Ming Lin, Madhav Ponamgi, Dinesh Manocha, and Jonathan Cohen

2:15

``Efficient model simplification with global error bounds'',

Jonathan Cohen, Dinesh Manocha, Amitabh Varshney, and Greg Turk

2:30

``Automatic generation of triangular irregular networks using greedy cuts'',

Claudio Silva, Joseph Mitchell, and Arie Kaufman

2:45

``Lossy compression of gridded elevation data'',

Wm Randolph Franklin

3:00

Coffee Break.

3:15

``Labeling a rectilinear map'',

Andy Mirzain and Binhai Zhu

3:30

``Kinematics-driven geometric modeling: A framework for simultaneous sculptured surface design and CNC tool path generation'',

Q. Jeffrey Ge

3:45

``Time-optimal nearest-neighbor computations on enhanced meshes'',

S. Olariu and I. Stojmenovic'

4:00

``Algorithm for clipping a polygon against a 2D arbitrary window'',

Shuwei Hua and Alade Tokuta

4:15

``On efficient algorithms of computational geometry for GIS'',

Oleg R. Musin