| 9-10 Session 1: Computational Geometry |
| 9-9:13 |
J. Mitchell and V. Polishchuk |
Minimum-perimeter enclosing k-gon |
| 9:15-9:28 |
J. Backer and D. Kirkpatrick |
Bounded-curvature paths in narrow simply connected polygons |
| 9:30-9:43 |
S. Bitner and O. Daescu |
Further segment spanned by points in R^3 |
| 9:45-9:58 |
M. Furer and S.P. Kasiwiswanathan |
Spanners for Geometric Intersection Graphs |
|
| 10-10:30 Coffee break |
| 10:30-11:30 Session 2: Computational Geometry |
| 10:30-10:43 |
Y. Liu and J. Snoeyink |
From Centroid Triangulations to Bivariate B-Splines |
| 10:45-10:58 |
E. Arkin, A. Efrat, C. Erten, F. Hurtado, J. Mitchell, V. Polishchuk and C. Wenk |
Shortest Tour of a Sequence of Disjoint Segments in L_1 |
| 11:00-11:13 |
J. Lenchner |
A faster Dynamic Programming Algorithm for Facility Location |
| 11:15-11:28 |
O. Daescu and J. Luo |
Computing Simple Paths on Points in Simple Polygons |
|
| 11:40-12:40 Invited Talk: Marjorie Senechal A point set puzzle revisited |
| 12:40 - 2:15 Lunch break |
| 2:15 - 3:15 Session 3: Computational Geometry |
| 2:15-2:28 |
T. Dey and R. Wenger |
Stability of Critical Points with Interval Persistence |
| 2:30-2:43 |
M. Dai and N. Amenta |
Approximate Nearest-Neighbors using TCQ-Trees |
| 2:45-2:58 |
D. Chen, Y. Chiang, N. Memon and X. Wu |
Lossless Geometry Compression for Steady-State and Time-Varying Tetrahedral Meshes |
| 3:00-3:13 |
H. Erten and A. Ungor |
On computing Meshes with Large Smallest Angles |
|
| 3:15-3:45 Coffee break |
| 3:45-4:45 Invited Talk: Branko Grunbaum Configurations: combinatorial, topological and geometric |
| 5-6:30 Poster session and 3D Printer Demo |
- Maria-Cecilia Rivara Delaunay terminal edge algorithm
- Andrey Chernikov and Nikos Chrisochoides Parallel Graded Generalized Delaunay Mesh Refinement
- Piyush Kumar and Amit Mhatre Surface Reconstruction and normal estimation using projective clustering
- Olga Gluchshenko and Horst Hamacher Optimal Algorithms for Computing of "Minimum Width Annulus" with Rectilinear and Chebyshev distances and in Undirected Networks
- Lance Miller, Thomas Peters and Alexander Russell Optimal Covers for Computational Topology on Parametric Curves
- Eli Packer Controlled Perturbation of Arrangements of Line Segments in 2D
- Lev Reyzin Two Player Tetris is PSPACE Hard
- Metin Inanc and W Randolph Franklin Terrain Representation Using Tessellation of Irregular Planar Tiles
- Perouz Taslakian and Godfried Toussaint Geometric Properties of Musical Rhythms
- Sherif Ghali Boolean Operations in Practice
- Pedro J. de Rezende Computing Convex Hulls on Beckenbach and Drandell Geometries
- Xin Dou and Xiaodong Wu Optimal Linear Time Algorithm for Intensity Map Splitting with Feathering in Radiation Therapy
- Daniel Tracy, W Randolph Franklin and Franklin Luk Multiple Observer Siting on a Compressed Terrain
- Umut Acar and Benoit Hudson Optimal-time dynamic mesh refinement: preliminary results
- Jonathan Lenchner Minimum Outer Layer and Zone Complexity
|