External-memory algorithms for processing line segments in geographic information systems
From MaRDI portal
Publication:868436
DOI10.1007/s00453-006-1208-zzbMath1107.68118OpenAlexW2164944647MaRDI QIDQ868436
Jeffrey Scott Vitter, Darren Erik Vengroff, Lars Arge
Publication date: 5 March 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1808/7200
Nonnumerical algorithms (68W05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (7)
Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ Cache-Oblivious Red-Blue Line Segment Intersection ⋮ Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os ⋮ Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions ⋮ External memory planar point location with logarithmic updates ⋮ Dynamic Planar Point Location in External Memory. ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model
This page was built for publication: External-memory algorithms for processing line segments in geographic information systems
