February

Fall 2017

Title	Type
Routing in Unit Disk Graphs	Page
Proximity in the age of distraction: Robust approximate nearest neighbor search	Page
New bounds and relations for some basic geometric problems	Page
Contacts	Page
Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching	Page
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning	Page
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM	Page
Reductions for Distinct Distances Problems in R^d	Page
Solid Modelling for VLSI Design	Page
Breaking depth-order cycles and other adventures in 3D	Page
Near-optimal (Euclidean) metric compression	Page
GIT primer	Page
CG seminar	Folder
Computational Geometry Seminar	Page