The aim of this workshop is to discuss and solve geometric problems related to sensor networks or robotics. The plan is to come together for one week, and each day from 9.30am to 6.00pm propose problems and attempt to solve them.

- Hugo Akitaya (Tsukuba University) hugoakitaya@gmail.com
- Habib M. Ammari (University of Michigan at Dearborn) hammari@umd.umich.edu
- Esther Arkin (Stony Brook University) esther.arkin@stonybrook.edu
- Huck Bennett (New York University) hbennett@cs.nyu.edu
- Peter Brass (City College New York) peter@cs.ccny.cuny.edu
- Yi-Jen Chiang (New York University) chiang@nyu.edu
- Alon Efrat (University of Arizona) alon@cs.arizona.edu
- Sylvester Eriksson-Bique (New York University) ebs@cims.nyu.edu
- Jie Gao (Stony Brook University) jgao@cs.stonybrook.edu
- Mayank Goswami (Max Planck Institut Saarbrücken) gmayank@mpi-inf.mpg.de
- Matthew Johnson (Lehman College) mpjohnson@gmail.com
- David Kirkpatrick (University of British Columbia) kirk@cs.ubc.ca
- Elmar Langetepe (University of Bonn) elmar.langetepe@informatik.uni-bonn.de
- Jon Lenchner (IBM Research Yorktown Heights) lenchner@us.ibm.com
- Joe Mitchell (Stony Brook University) jsbm@ams.stonybrook.edu
- Eli Packer (IBM Research Haifa) elip@il.ibm.com
- Anika Rounds (Tufts Univ) Anika.Rounds@tufts.edu
- Jack Snoeyink (NSF and University of North Carolina at Chapel Hill) jsnoein@nsf.gov
- Kiril Solovey (Tel Aviv University) kirilsolo@gmail.com
- Csaba Toth (California State University Northridge) cdtoth@eecs.tufts.edu
- Chee Yap (New York University) yap@cs.nyu.edu
- Jiemin Zeng (Stony Brook University) jieminzeng@gmail.com

The conference hotel is the Holiday Inn in Mt Kisco. We will provide van service between the Holiday Inn and the conference location, which will be in the IBM Research Lab in Yorktown Heights. See here how to get to the Yorktown Heights lab.

- Guarding Segments in a Box, in many variants (Jon Lenchner) Notes by Jon Lenchner
- r-gather problem: clustering points so that each cluster contains at least r points, and the maximum diameter is minimized (Jiemin Zeng)
- Guard Network: place guards in a polygon so that the entire polygon is seen, the r-distance network of the guards is connected, and the number of guards is minimized (Jie Gao) Notes by Jie Gao
- Optimal Lawnmower Paths in a Square: what is the closed shortest path in a square of sidelength L such that each point of the square has distance at most 1 to the path (Peter Brass)
- Moving Two Square Robots in an Orthogonal Polygon: the robots should not overlap during the motion (Hugo Akitaya)
- Approximate Shortest Path for a Disk among Obstacles in the Subdivision Model (David Kirkpatrick)
- Pre-emptive Strategies for Smoothing in Quad-Tree like structures (Chee Yap)
- Deciding Optimality of a Lawnmower Path (Huck Bennett) Notes by Huck Bennett
- Placing Sensors to Minimize Uncertainty Regions (Eli Packer) Notes by Eli Packer
- Watchman Routes in 3D (Joe Mitchell)
- 231-free grid Point Problem (Mayank Goswami)
- Placing Sensors to detect primary and secondary transmitters (Alon Efrat)
- Placing Isolation Guards (Joe Mitchell)

Peter Brass (peter@cs.ccny.cuny.edu or phjmbrass@gmail.com)