External-memory algorithms for processing line segments in geographic information systems
From MaRDI portal
(Redirected from Publication:868436)
Recommendations
Cited in
(14)- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
- Lower bounds for intersection searching and fractional cascading in higher dimension
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Cache-Oblivious Red-Blue Line Segment Intersection
- scientific article; zbMATH DE number 1303612 (Why is no real title available?)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- scientific article; zbMATH DE number 1424323 (Why is no real title available?)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
- Dynamic Planar Point Location in External Memory.
- Permuting and batched geometric lower bounds in the I/O model
- I/O-Efficient Algorithms for Problems on Grid-Based Terrains
- External memory planar point location with logarithmic updates
- External-memory algorithms for processing line segments in geographic information systems
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)
