Orthogeodesic point-set embedding of trees

DOI10.1007/978-3-642-25878-7_6MaRDI QIDQ3223943zbMATH OpenOpenAlexFDO

Authors Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug

Publication date 9 March 2012

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25878-7_6

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Orthogeodesic point-set embedding of trees
• Point-set embeddings of plane 3-trees (extended abstract)
• Point-Set Embedding of Trees with Edge Constraints
• Point-set embeddings of trees with given partial drawings
• On L-shaped point set embeddings of trees: first non-embeddable examples

Cites work

• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• 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
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Hamiltonian orthogeodesic alternating paths
• Manhattan-geodesic embedding of planar graphs
• On embedding an outer-planar graph in a point set
• On simultaneous planar graph embeddings
• Optimal Algorithms to Embed Trees in a Point Set
• Orthogeodesic point-set embedding of trees
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices

Cited in

(6)

• Orthogeodesic point-set embedding of trees
• Application of Bearing and Distance Trees to the Identification of Landmarks on the Coast
• On L-shaped point set embeddings of trees: first non-embeddable examples
• Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
• Manhattan-geodesic embedding of planar graphs
• scientific article; zbMATH DE number 1080079 (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 Q3223943)