|
265
|
A data structure for dynamic trees
– D D Sleator, R E Tarjan
- 1983
|
|
147
|
Optimal point location in a monotone subdivision
– Herbert Edelsbrunner, Leonidas J Guibas, Jorge Stolfi
- 1986
|
|
230
|
Optimal search in planar subdivisions
– D G Kirkpatrick
- 1983
|
|
160
|
Planar point location using persistent search trees
– Neil Sarnak, Robert E Tarjan
- 1986
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
23
|
FULLY DYNAMIC POINT LOCATION IN A MONOTONE SUBDIVISION
– Franco P. Preparata, Roberto Tamassia
- 1989
|
|
643
|
Algorithms in Combinatorial Geometry
– Herbert Edelsbrunner
- 1987
|
|
59
|
Location of a point in a planar subdivision and its applications
– D T Lee, F P Preparata
- 1976
|
|
26
|
New results on dynamic planar point location
– S Cheng, R Janardan
- 1992
|
|
49
|
Biased search trees
– S W Bent, D D Sleator, R E Tarjan
- 1985
|
|
212
|
A dichromatic framework for balanced trees
– L J Guibas, R Sedgewick
- 1978
|
|
62
|
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph
– David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert E. Tarjan, Jeffery Westbrook, Moti Yung
- 1992
|
|
244
|
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms
– Herbert Edelsbrunner, Ernst Peter Mücke
- 1990
|
|
74
|
Optimal shortest path queries in a simple polygon
– L Guibas, J Hershberger
- 1989
|
|
74
|
Visibility and intersection problems in plane geometry
– B Chazelle, L Guibas
- 1985
|
|
31
|
A new approach to planar point location
– F P Preparata
- 1981
|
|
25
|
Dynamic expression trees and their applications
– R F Cohen, R Tamassia
- 1991
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
43
|
Computational Geometry–An Introduction
– F P Preparata, M I Shamos
- 1985
|
