Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
DOI10.1016/J.EJC.2023.103806zbMATH Open1542.0504MaRDI QIDQ6563990FDOQ6563990
Authors: Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani 
Publication date: 28 June 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Graph representations (geometric and intersection representations, etc.) (05C62) Graph minors (05C83)
Cites Work
- Graph Classes: A Survey
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Characterizations of outerplanar graphs
- Connected rigidity matroids and unique realizations of graphs
- Title not available (Why is that?)
- Conditions for Unique Graph Realizations
- The Molecule Problem: Exploiting Structure in Global Optimization
- Planar Embeddings of Graphs with Specified Edge Lengths
- Triangulating a simple polygon in linear time
- The Recognition of Series Parallel Digraphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On-Line Planarity Testing
- On the planar edge-length ratio of planar graphs
- Reconstructing a three-dimensional model with arbitrary errors
- Realizability of graphs and linkages
- Straight line embeddings of cubic planar graphs with integer edge lengths
- Distinct distances in graph drawings
- Angle and Distance Constraints on Tree Drawings
- Checking the convexity of polytopes and the planarity of subdivisions
- Optimal binary space partitions for segments in the plane
- Degenerate drawing of outerplanar graphs with two edge lengths
- Drawing outerplanar graphs using thirteen edge lengths
- Drawing outerplanar graphs using three edge lengths
- Title not available (Why is that?)
- DISTANCE VISIBILITY GRAPHS
- One-Page Book Embedding under Vertex-Neighborhood Constraints
- On-line construction of the convex hull of a simple polyline
- Fixed edge-length graph drawing is NP-hard
- Planar and plane slope number of partial 2-trees
- Windrose planarity: embedding graphs with direction-constrained edges
- Square-contact representations of partial 2-trees and triconnected simply-nested graphs
- Radial drawings of graphs: geometric constraints and trade-offs
- Constraints in graph drawing algorithms
- Constrained visibility representations of graphs
- The complexity of drawing a graph in a polygonal region
- An optimal algorithm for reconstructing point set order types from radial orderings
- Anchored drawings of planar graphs
- Who needs crossings? Hardness of plane graph rigidity
- Non-crossing paths with geographic constraints
- On the Edge-Length Ratio of 2-Trees
- Recognizing stick graphs with and without length constraints
- 2-colored point-set embeddings of partial 2-trees
- Stack and queue number of 2-trees
Cited In (1)
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)
