Planar straight-line realizations of 2-trees with prescribed edge lengths
From MaRDI portal
Publication:2151440
DOI10.1007/978-3-030-92931-2_12OpenAlexW3198108798MaRDI QIDQ2151440
Manuel Borrazzo, Giuseppe Di Battista, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani, Carlos Alegría
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2108.12628
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing outerplanar graphs using three edge lengths
- Radial drawings of graphs: geometric constraints and trade-offs
- 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
- Planar and Plane Slope Number of Partial 2-Trees
- Thirty Essays on Geometric Graph Theory
- 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
- Conditions for Unique Graph Realizations
- 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
- 2-colored point-set embeddings of partial 2-trees
- Stack and queue number of 2-trees
