321 citations · 2k across the 200 of their papers we have counts for
6 papers · 2 filters
Steinitz Theorems for Orthogonal Polyhedra
David Eppstein, Elena Mumford
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By anal…
Going Off-road: Transversal Complexity in Road Networks
David Eppstein, Michael T. Goodrich, Lowell Trott
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average tr…
Optimally fast incremental Manhattan plane embedding and planar tight span construction
David Eppstein
We describe a data structure, a rectangular complex, that can be used to represent hyperconvex metric spaces that have the same topology (although not necessarily the same distance…
Graph-Theoretic Solutions to Computational Geometry Problems
David Eppstein
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic a…
Orientation-Constrained Rectangular Layouts
David Eppstein, Elena Mumford
We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges…
Area-Universal Rectangular Layouts
David Eppstein, Elena Mumford, Bettina Speckmann +1
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms…