activity
20052020
most citedSkip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets

7 citations · 10 across the 4 of their papers we have counts for

collaborators

7 papers

cs.CG2020★ 2 cited

1D and 2D Flow Routing on a Terrain

Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal +1

An important problem in terrain analysis is modeling how water flows across a terrain creating floods by forming channels and filling depressions. In this paper we study a number o…

cs.CV2019

Learning to Find Hydrological Corrections

Lars Arge, Allan Grønlund, Svend Christian Svendsen +1

High resolution Digital Elevation models, such as the (Big) grid terrain model of Denmark with more than 200 billion measurements, is a basic requirement for water flow modelling a…

cs.CG2018

Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon

Pankaj K. Agarwal, Lars Arge, Frank Staals

We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set of point sites in a static simple polygon . Our data structure allow…

cs.DS2017

External Memory Pipelining Made Easy With TPIE

Lars Arge, Mathias Rav, Svend C. Svendsen +1

When handling large datasets that exceed the capacity of the main memory, movement of data between main memory and external memory (disk), rather than actual (CPU) computation time…

cs.CG2017★ 1 cited

Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon

Lars Arge, Frank Staals

We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set of point sites in a static simple polygon . Our data structure allow…

cs.DS2013

RAM-Efficient External Memory Sorting

Lars Arge, Mikkel Thorup

In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are move…