Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

Cached

Download Links

by Yoav Giyora , Haim Kaplan
Citations:4 - 0 self

Documents Related by Co-Citation

40 New data structures for orthogonal range queries – D E Willard - 1985
85 A pedestrian approach to ray shooting: Shoot a ray, take a walk – J Hershberger, S Suri - 1995
5 Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, and Range Reporting – Guy E. Blelloch - 2008
11 New data structures for orthogonal queries – D E Willard - 1985
19 Reporting and counting segment intersections – B Chazelle - 1986
1108 Multidimensional binary search trees used for associative searching – J L Bentley - 1975
67 New data structures for orthogonal range searching – Stephen Alstrup, Theis Rauhe, Gerth Stølting Brodal - 2000
159 Fractional cascading: I. A data structuring technique – Bernard Chazelle, Leonidas J. Guibas - 1986
176 Tarjan. Scaling and related techniques for geometry problems – H N Gabow, J L Bentley, R E - 1984
94 R.J.: Multidimensional searching problems – D Dobkin, Lipton - 1976
56 A data structure for orthogonal range queries – S Lueker - 1978
82 Binary search trees of bounded balance – J Nievergelt, M Reingold E - 1973
7 Spanning trees and spanners. Handbook of Computational Geometry – D Eppstein - 2000
1 Computing in Euclidean geometry – J MacGregor Smith, P Winter - 1992
1 Dilation and detour in geometric networks, chap – J Gudmundsson, C Knauer - 2007
2 Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors, Algorithmica 12 – Y C Wee, S Chaiken, S S Ravi - 1994
5 Salowe: A new way to weigh malnourished Euclidean graphs – G Das, G Narasimhan, J - 1995
14 Dynamic orthogonal segment intersection search – H Imai, T Asano - 1987
21 A fast algorithm for approximating the detour of a polygonal chain – A Ebbers-Baumann, R Klein, E Langetepe, A Lingas