Orthogeodesic point-set embedding of trees
DOI10.1016/J.COMGEO.2013.04.003zbMATH Open1279.65027OpenAlexW2053113908MaRDI QIDQ2391540FDOQ2391540
Authors: Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug 
Publication date: 31 July 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0925772113000369
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- How to draw a planar graph on a grid
- Title not available (Why is that?)
- A better heuristic for orthogonal graph drawings
- Drawing planar graphs using the canonical ordering
- Orthogonal graph drawing with flexibility constraints
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the computational complexity of upward and rectilinear planarity testing
- Universality considerations in VLSI circuits
- Optimal Algorithms to Embed Trees in a Point Set
- Manhattan-geodesic embedding of planar graphs
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- On embedding an outer-planar graph in a point set
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Theoretical results on at most 1-bend embeddability of graphs
- Drawing planar graphs on \(\frac{8}{9}n^2\) area
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Drawing graphs with vertices at specified positions and crossings at large angles
- Hamiltonian orthogeodesic alternating paths
- Orthogeodesic point-set embedding of trees
Cited In (12)
- Application of Bearing and Distance Trees to the Identification of Landmarks on the Coast
- -shaped point set embeddings of high-degree plane graphs
- Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
- Orthogeodesic point-set embedding of trees
- Rollercoasters and Caterpillars
- Rollercoasters: Long Sequences without Short Runs
- On L-shaped point set embeddings of trees: first non-embeddable examples
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
- Manhattan-geodesic embedding of planar graphs
- Title not available (Why is that?)
This page was built for publication: Orthogeodesic point-set embedding of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391540)
