Active Bibliography

560 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
4 Fast fractional cascading and its applications – Qingmin Shi, Joseph Jaja - 2003
Regions, Distances and Graphs – Sebastien Collette
27 A compact piecewise-linear Voronoi diagram for convex sites in the plane – Michael Mcallister, David Kirkpatrick, Jack Snoeyink - 1996
13 Efficient Expected-Case Algorithms for Planar Point Location – Sunil Arya, Siu-Wing Cheng, David M. Mount, H. Ramesh - 2000
65 Closest-Point Problems in Computational Geometry – Michiel Smid - 1997
42 Approximation schemes for NP-hard geometric optimization problems: A survey – Sanjeev Arora - 2003
1 Fast constructions of light-weight spanners for general graphs – Michael Elkin, Shay Solomon - 2013
7 Using Sparsification for Parametric Minimum Spanning Tree Problems – David Fern├índez-baca, Giora Slutzki, David Eppstein - 1996
1 Novel transformation techniques using q-heaps with applications to computational geometry – Qingmin Shi, Joseph Jaja
5 On Point Location and Motion Planning among Simplices – Marco Pellegrini - 1996
13 On the Exact Worst Case Query Complexity of Planar Point Location – Udo Adamy, Raimund Seidel - 1998
A Static Optimality Transformation with Applications to Planar Point Location – John Iacono, Wolfgang Mulzer - 2012
12 Robust Proximity Queries in Implicit Voronoi Diagrams – Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia - 1996
11 Efficient Triangulation-Based Pathfinding – Douglas Jon Demyen - 2007
20 Linear-time reconstruction of Delaunay triangulations with applications – Jack Snoeyink, Marc Van Kreveld - 1997
49 A polynomial-time approximation scheme for weighted planar graph TSP – Sanjeev Arora, Michelangelo Grigni, David Karger, Philip Kleins, Andrzej Woloszyn - 1998
8 Optimal Two-Dimensional Triangulations – Tiow-Seng Tan - 1993
13 Average case analysis of dynamic geometric optimization – David Eppstein - 1995