Planar Embeddings of Graphs with Specified Edge Lengths
From MaRDI portal
Recommendations
Cited in
(30)- Metric graphs elastically embeddable in the plane
- Geodesic embeddings and planar graphs
- Embeddings of planar graphs that minimize the number of long-face cycles
- Algorithmic aspects of proportional symbol maps
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- On the edge-length ratio of planar graphs
- Discrete trace theorems and energy minimizing spring embeddings of planar graphs
- Free edge lengths in plane graphs
- Plane embeddings of planar graph metrics
- The complexity of separating points in the plane
- Equilateral drawing of 2-connected planar chordal graphs
- Bounded Embeddings of Graphs in the Plane
- Realizability of graphs and linkages
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
- Who needs crossings? Hardness of plane graph rigidity
- Straight line embeddings of cubic planar graphs with integer edge lengths
- Boolean approach to planar embeddings of a graph
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Free edge lengths in plane graphs
- On the Edge-Length Ratio of 2-Trees
- On edge-length ratios of partial 2-trees
- A Census of Plane Graphs with Polyline Edges
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Graph Drawing
- Unit-length rectangular drawings of graphs
- Embedding a triangular graph within a given boundary
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Unit-length rectangular drawings of graphs
- Bounds on the edge-length ratio of 2-outerplanar graphs
- Realizing planar linkages in polygonal domains
This page was built for publication: Planar Embeddings of Graphs with Specified Edge Lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301415)
