Accepted Abstracts

Session # 1

• The Frechet Distance Problem in Weighted Regions
  Yam Ki Cheung and Ovidiu Daescu
• New Results on Polygonal Chain Simplification with Small Angle Constraints
  Ovidiu Daescu and Anastasia Kurdia
• Convergence of the shadow sequence of inscribed polygons
  Paco Gomez, Perouz Taslakian and Godfried Toussaint
• Connectivity-based Sensor Network Localization with Incremental Delaunay Refinement
  Yue Wang, Sol Lederer and Jie Gao

Session #2

• Towards Surface Reconstruction in Linear Time
  Benoît Hudson
• Approximating Points by Piecewise Linear Functions
  Danny Z. Chen and Haitao Wang
• Relative Convexity and the Medial Cover
  Jason Williams
• Degree-driven algorithm design for computing the Voronoi diagram
  David L. Millman and Jack Snoeyink

Session #3

• Scheduling Aircraft to Reduce Controller Workload
  Joondong Kim, Alexander Kroeller, Joseph Mitchell and Girishkumar Sabhnani
• Obstacle-Avoiding Fastest Paths in Anisotropic Media
  Irina Dolinskaya and Robert Smith
• Path Planning on Complex Terrain
  Dan Tracy, W Randolph Franklin, Barb Cutler, Franklin Luk, Marcus Andrade and Jared Stookey
• Shortest Anisotropic Paths with Few Bends is NP-complete
  Mustaq Ahmed and Anna Lubiw

Session #4

• Application of Delaunay triangulation and shortest path algorithms for wildfire propagation modeling
  Alexander Stepanov and James Smith
• Routing Multi-Class Traffic Flows in the Plane is Hard
  Shang Yang, Joseph Mitchell and Valentin Polishchuk
• Spatial Distribution in Routing Table Design for Sensor Networks
  Rik Sarkar, Xianjin Zhu and Jie Gao
• Resolving Loads with Positive Interior Stresses
  Günter Rote and André Schulz
• Cone Depth and the Center Vertex Theorem
  Don Sheehy, Gary Miller and Todd Phillips

Session #5

• Generalized Ham-Sandwich Cuts
  William Steiger and Jihui Zhao
• Internal surveillance problems in data centers
  Jonathan Lenchner, Eli Packer, Rajarshi Das and Jeffrey Kephart
• Reordering Ruppert's Algorithm
  Alexander Rand
• On the number of simple arrangements of five double pseudolines
  Julien Ferté, Vincent Pilaud and Michel Pocchiola

Session #6

• Area and Volume of Molecular Skin Surfaces
  Xinwei Shi and Patrice Koehl
• Operating on Large Geometric Datasets
  W Randolph Franklin
• Reconstructing Polygons from Scanner Data
  Therese Biedl, Stephane Durocher and Jack Snoeyink
• Fast Sizing Calculations for Meshing
  Gary Miller, Todd Phillips and Don Sheehy
• Robust Shape Clustering: Computing 1-medians on Riemannian Manifolds
  Thomas Fletcher, Suresh Venkatasubramanian and Sarang Joshi

Session #7

• Combinatorial 2D Zeolites
  Herman Servatius
• A streaming algorithm for computing an approximate minimum spanning ellipse
  Asish Mukhopadhyay and Eugene Greene
• A tight lower bound on the average distance from the Fermat-Weber center of a planar convex body
  Adrian Dumitrescu and Csaba Toth
• Convex Partitions with 2-Edge Connected Dual Graphs
  Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane Souvaine and Csaba Toth
• The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
  Jie Gao and Dengpan Zhou