External-memory algorithms for processing line segments in geographic information systems
From MaRDI portal
Publication:868436
DOI10.1007/S00453-006-1208-ZzbMATH Open1107.68118OpenAlexW2164944647MaRDI QIDQ868436FDOQ868436
Authors: Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter 
Publication date: 5 March 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1808/7200
Recommendations
Nonnumerical algorithms (68W05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Cited In (12)
- Dynamic Planar Point Location in External Memory.
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Title not available (Why is that?)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
- Lower bounds for intersection searching and fractional cascading in higher dimension
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- Permuting and batched geometric lower bounds in the I/O model
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
- External-memory algorithms for processing line segments in geographic information systems
- Cache-Oblivious Red-Blue Line Segment Intersection
- External memory planar point location with logarithmic updates
- I/O-Efficient Algorithms for Problems on Grid-Based Terrains
This page was built for publication: External-memory algorithms for processing line segments in geographic information systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868436)
