635 citations
- Centrum Wiskunde & InformaticaNL21 papers
- California Institute of TechnologyUS5 papers
- University of AmsterdamNL4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Courant Institute of Mathematical SciencesUS3 papers
- Delft University of TechnologyNL3 papers
- IMECBE3 papers
- Max Planck Institute of Quantum OpticsDE3 papers
- Microsoft (United States)US3 papers
- Radboud University NijmegenNL3 papers
- University of British ColumbiaCA3 papers
- Florida State UniversityUS2 papers
5 papers · 1 filter
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…
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
Herman Haverkort, Freek van Walderveen
Space-filling curves can be used to organise points in the plane into bounding-box hierarchies (such as R-trees). We develop measures of the bounding-box quality of space-filling c…
Untangling a Planar Graph
Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto +3
A straight-line drawing of a planar graph need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of . Let shift de…
Computing a Minimum-Dilation Spanning Tree is NP-hard
Otfried Cheong, Herman Haverkort, Mira Lee
In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum fac…