33 citations · 73 across the 19 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CG2018
Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time -- a proof by reduction from epsilon-closeness
Herman Haverkort
We consider the problem of computing, given a set S of n points in the plane, which points of S are vertices of the convex hull of S. For certain variations of this problem, differ…
cs.DS2018★ 1 cited
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…