Sciweavers

Share
8 search results - page 1 / 2
» Optimal External Memory Planar Point Enclosure
Sort
View
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
9 years 6 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
WAE
2000
128views Algorithms» more  WAE 2000»
9 years 2 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
COMPGEOM
2008
ACM
9 years 3 months ago
External memory planar point location with logarithmic updates
Lars Arge, Gerth Stølting Brodal, S. Sriniv...
FSTTCS
2000
Springer
9 years 5 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
9 years 7 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
books