David Eppstein - Publications
- Edges and switches, tunnels and bridges.
D. Eppstein,
M. van Kreveld,
E. Mumford, and
B. Speckmann.
23rd European Workshop on Computational Geometry (EWCG'07), Graz, 2007.
10th Worksh. Algorithms and Data Structures, Halifax, Nova Scotia, 2007.
Springer, Lecture Notes in Comp. Sci. 4619, 2007, pp. 77–88.
Tech.
Rep. UU-CS-2007-042, Utrecht Univ., Dept. of Information and
Computing Sciences, 2007.
arXiv:0705.0413.
Comp.
Geom. Theory & Applications 42 (8): 790–802, 2009 (special issue
for EWCG'07).
We show how to solve several versions of the problem of casing graph drawings:
that is, given a drawing, choosing to draw one edge as upper and one
lower at each crossing in order to improve the drawing's readability.
(WADS talk slides)
- Improved grid map layout by point set matching.
D. Eppstein,
M. van Kreveld,
B. Speckmann, and
F. Staals.
28th European Workshop on Computational Geometry (EuroCG'12), Assisi,
Italy, 2012.
6th IEEE Pacific Visualization Conf. (PacificVis), Sydney, Australia, 2013.
Int. J. Comput. Geom. Appl. 25 (2): 101–122, 2015.
We study the problem of matching geographic regions to points in a
regular grid, minimizing the distance between each region's centroid and
the corresponding grid point, and preserving as much as possible the
relative orientations between pairs of regions.
Co-authors –
Publications –
David Eppstein –
Theory Group –
Inf. & Comp. Sci. –
UC Irvine
Semi-automatically filtered
from a common source file.