Table of Contents
Articles
| Welcome from the Editors-in-Chief | |
| Kenneth L. Clarkson, Günter Rote | 1-2 |
| Happy Endings for Flip Graphs | |
| David Eppstein | 3-28 |
| On Visibility and Blockers | |
| Attila Pór, David R. Wood | 29-40 |
| On the Stretch Factor of Convex Delaunay Graphs | |
| Prosenjit Bose, Paz Carmi, Sebastien Collette, Michiel Smid | 41-56 |
| Visibility Maps of Realistic Terrains have Linear Smoothed Complexity | |
| Mark de Berg, Herman Haverkort, Constantinos P. Tsirogiannis | 57-71 |
| Computing Multidimensional Persistence | |
| Gunnar Carlsson, Gurjeet Singh, Afra J. Zomorodian | 72-100 |
| Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time | |
| Christian Wulff-Nilsen | 101-122 |
This work is licensed under a Creative Commons Attribution 3.0 License.
ISSN: 1920-180X