Density of range capturing hypergraphs...1–21 Strict confluent drawing...22–46 On self-approaching and increasing-chord drawings of 3-connected planar graphs...47–69 2-manifold recognition is in logspace...70–85 Silhouette of a random polytope...86–99 Adjacency-preserving spatial treemaps...100–122 Finding shortest non-trivial cycles in directed graphs on surfaces...123–148 Polyhedral Gauss sums, and polytopes with symmetry...149–170 Rigid origami vertices: conditions and forcing sets...171–184 Recursively-regular subdivisions and applications...185–220 Weighted geometric set multi-cover via quasi-uniform sampling...221–236 An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface...237–255 The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS...256–284 Flat norm decomposition of integral currents...285–307 Consistent labeling of rotating maps...308–331 The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$...332–359 Near-linear time medial axis approximation of smooth curves in $\mathbb{R}^3$...360–429 Recognizing shrinkable complexes is NP-complete...430–443 On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere...444–472 Two-point L1 shortest path queries in the plane...473–519 A plane 1.88-spanner for points in convex position...520–539 On isolating points using unit disks...540–557