Testing the planar straight-line realizability of 2-trees with prescribed edge lengths

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Signed and weighted graphs (05C22)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Drawing outerplanar graphs using three edge lengths
Radial drawings of graphs: geometric constraints and trade-offs
Distinct distances in graph drawings
Rectilinear planar layouts and bipolar orientations of planar graphs
On-line construction of the convex hull of a simple polyline
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Triangulating a simple polygon in linear time
Constrained visibility representations of graphs
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
Characterizations of outerplanar graphs
Checking the convexity of polytopes and the planarity of subdivisions
Constraints in graph drawing algorithms
The complexity of drawing a graph in a polygonal region
Connected rigidity matroids and unique realizations of graphs
Fixed edge-length graph drawing is NP-hard
Degenerate drawing of outerplanar graphs with two edge lengths
Drawing outerplanar graphs using thirteen edge lengths
Realizability of Graphs and Linkages
Planar and Plane Slope Number of Partial 2-Trees
Anchored Drawings of Planar Graphs
Who Needs Crossings? Hardness of Plane Graph Rigidity
DISTANCE VISIBILITY GRAPHS
Reconstructing a three-dimensional model with arbitrary errors
Straight line embeddings of cubic planar graphs with integer edge lengths
Angle and Distance Constraints on Tree Drawings
The Recognition of Series Parallel Digraphs
Conditions for Unique Graph Realizations
Graph Classes: A Survey
Non-crossing Paths with Geographic Constraints
Windrose Planarity
One-Page Book Embedding under Vertex-Neighborhood Constraints
On-Line Planarity Testing
The Molecule Problem: Exploiting Structure in Global Optimization
On the Edge-Length Ratio of 2-Trees
On the planar edge-length ratio of planar graphs
Recognizing Stick Graphs with and without Length Constraints
OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
Planar Embeddings of Graphs with Specified Edge Lengths
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
2-colored point-set embeddings of partial 2-trees
Stack and queue number of 2-trees

This page was built for publication: Testing the planar straight-line realizability of 2-trees with prescribed edge lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563990)