activity
19982026
most citedDiameter and Treewidth in Minor-Closed Graph Families

321 citations · 2k across the 200 of their papers we have counts for

collaborators
Showing 2011 · cs.CGShow all

5 papers · 2 filters

cs.CG2011★ 5 cited

Planar and Poly-Arc Lombardi Drawings

Christian A. Duncan, David Eppstein, Michael T. Goodrich +2

In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi…

cs.CG2011★ 3 cited

On 2-Site Voronoi Diagrams under Geometric Distance Functions

Gill Barequet, Matthew T. Dickerson, David Eppstein +2

We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primi…

cs.CG2011★ 2 cited

Adjacency-Preserving Spatial Treemaps

Kevin Buchin, David Eppstein, Maarten Löffler +2

Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms i…

cs.CG2011★ 1 cited

Tracking Moving Objects with Few Handovers

David Eppstein, Michael T. Goodrich, Maarten Löffler

We study the online problem of assigning a moving point to a base-station region that contains it. For instance, the moving object could represent a cellular phone and the base sta…

cs.CG2011★ 7 cited

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

David Eppstein, Maarten Löffler

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is mu…