|
11
|
Average case analysis of dynamic geometric optimization
– David Eppstein
- 1995
|
|
4
|
Fast fractional cascading and its applications
– Qingmin Shi, Joseph Jaja
- 2003
|
|
|
Updating Widths and Maximum Spanning Trees using the Rotating Caliper Graph
– David Eppstein
- 1993
|
|
27
|
A compact piecewise-linear Voronoi diagram for convex sites in the plane
– Michael Mcallister, David Kirkpatrick, Jack Snoeyink
- 1996
|
|
472
|
Voronoi diagrams -- a survey of a fundamental geometric data structure
– Franz Aurenhammer
- 1991
|
|
12
|
Efficient Expected-Case Algorithms for Planar Point Location
– Sunil Arya, Siu-Wing Cheng, David M. Mount, H. Ramesh
- 2000
|
|
35
|
Approximation schemes for NP-hard geometric optimization problems: A survey
– Sanjeev Arora
- 2003
|
|
7
|
Using Sparsification for Parametric Minimum Spanning Tree Problems
– David Fernández-baca, Giora Slutzki, David Eppstein
- 1996
|
|
48
|
Proximity Problems on Moving Points
– Julien Basch, Leonidas J. Guibas, Li Zhang
- 1997
|
|
|
Persistence, Offline Algorithms, and Space Compaction
– David Eppstein
- 1991
|
|
3
|
Output-Sensitive Construction Of Convex Hulls
– Timothy Moon-yew Chan
- 1995
|
|
44
|
A polynomial-time approximation scheme for weighted planar graph TSP
– Sanjeev Arora, Michelangelo Grigni, David Karger, Philip Kleins, Andrzej Woloszyn
- 1998
|
|
6
|
On Point Location and Motion Planning among Simplices
– Marco Pellegrini
- 1996
|
|
1
|
Novel transformation techniques using q-heaps with applications to computational geometry
– Qingmin Shi, Joseph Jaja
|
|
12
|
On the Exact Worst Case Query Complexity of Planar Point Location
– Udo Adamy, Raimund Seidel
- 1998
|
|
8
|
Optimal Two-Dimensional Triangulations
– Tiow-Seng Tan
- 1993
|
|
12
|
Robust Proximity Queries in Implicit Voronoi Diagrams
– Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
- 1996
|
|
6
|
Efficient Triangulation-Based Pathfinding
– Douglas Jon Demyen
- 2007
|
|
|
Regions, Distances and Graphs
– Sebastien Collette
|
