research
∙
09/02/2022
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface
In this paper, we analyze the approximation quality of a greedy heuristi...
share
research
∙
07/15/2022
The limit of L_p Voronoi diagrams as p → 0 is the bounding-box-area Voronoi diagram
We consider the Voronoi diagram of points in the real plane when the dis...
research
∙
03/14/2022
Minimum-Error Triangulations for Sea Surface Reconstruction
We apply state-of-the-art computational geometry methods to the problem ...
research
∙
12/01/2021
Hyperbolae are the locus of constant angle difference
Given two points A,B in the plane, the locus of all points P for which t...
research
∙
03/28/2020
Plane-filling trails
The order in which plane-filling curves visit points in the plane can be...
research
∙
05/21/2019
Shortest-Path-Preserving Rounding
Various applications of graphs, in particular applications related to fi...
research
∙
12/04/2018
Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time -- a proof by reduction from epsilon-closeness
We consider the problem of computing, given a set S of n points in the p...
research
∙
10/03/2018
A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains
Given a grid terrain T and a viewpoint v, the viewshed of v is the set o...
research
∙
11/13/2017