Concepedia

Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges

J. Joseph Fowler, Michael Jünger, Stephen Kobourov, Michael Schulz

Computational Geometry · 2011 · 11 citations · 17 references

DOI

Concepts

References

17

How to draw a planar graph on a grid

Hubert de Fraysseix, János Pach, Richard Pollack · COMBINATORICA · 1990 · 644 citations

, , +9

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

John Hershberger, Subhash Suri · SIAM Journal on Computing · 1999 · 326 citations

, , +13

A kinetic framework for computational geometry

Leo J. Guibas, Lyle Ramshaw, Jorge Stolfi · 1983 · 224 citations

, , +14

A linear algorithm for embedding planar graphs using PQ-trees

Norishige Chiba, Takao Nishizeki, Shigenobu Abe et al. · Journal of Computer and System Sciences · 1985 · 198 citations

, , +11

Embedding Planar Graphs at Fixed Vertex Locations

János Pach, Rephael Wenger · Graphs and Combinatorics · 2001 · 133 citations · Full text

, , +10