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

zbMATH Keywords

treegraph drawingcaterpillarorthogonal drawingManhattan distanceorthogeodesic point-set embedding

Mathematics Subject Classification ID

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)

Recommendations

• Orthogeodesic point-set embedding of trees
• Point-Set Embedding of Trees with Edge Constraints
• Point-set embeddings of trees with given partial drawings
• \(L\)-shaped point set embeddings of high-degree plane graphs
• Planar embedding of trees on point sets without the general position assumption

Cites Work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• A better heuristic for orthogonal graph drawings
• Drawing colored graphs on colored points
• Drawing colored graphs with constrained vertex positions and few bends per edge
• Drawing graphs with vertices at specified positions and crossings at large angles
• Drawing planar graphs on \(\frac{8}{9}n^2\) area
• Drawing planar graphs using the canonical ordering
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Hamiltonian orthogeodesic alternating paths
• How to draw a planar graph on a grid
• Manhattan-geodesic embedding of planar graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On embedding an outer-planar graph in a point set
• On the computational complexity of upward and rectilinear planarity testing
• Optimal Algorithms to Embed Trees in a Point Set
• Orthogeodesic point-set embedding of trees
• Orthogonal graph drawing with flexibility constraints
• 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
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• Universality considerations in VLSI circuits

Cited In (11)

• Improved bounds for drawing trees on fixed points with L-shaped edges
• Rollercoasters and caterpillars
• Application of Bearing and Distance Trees to the Identification of Landmarks on the Coast
• Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
• Orthogeodesic point-set embedding of trees
• 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
• Manhattan-geodesic embedding of planar graphs
• \(L\)-shaped point set embeddings of high-degree plane graphs
• Title not available (Why is no real title available?)

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)