33 citations · 73 across the 19 of their papers we have counts for
4 papers · 1 filter
A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains
Herman Haverkort, Laura Toma
Given a grid terrain T and a viewpoint v, the viewshed of v is the set of grid points of T that are visible from v. To decide whether a point p is visible one needs to interpolate…
I/O-optimal algorithms on grid graphs
Herman Haverkort
Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbou…
Simple I/O-efficient flow accumulation on grid terrains
Herman Haverkort, Jeffrey Janssen
The flow accumulation problem for grid terrains takes as input a matrix of flow directions, that specifies for each cell of the grid to which of its eight neighbours any incoming w…
I/O efficient bisimulation partitioning on very large directed acyclic graphs
Jelle Hellings, George H. L. Fletcher, Herman Haverkort
In this paper we introduce the first efficient external-memory algorithm to compute the bisimilarity equivalence classes of a directed acyclic graph (DAG). DAGs are commonly used t…