Orthogeodesic Point-Set Embedding of Trees

DOI10.1007/978-3-642-25878-7_6zbMath1311.68110OpenAlexW2148379616MaRDI QIDQ3223943

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

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)

Related Items

Orthogeodesic point-set embedding of trees ⋮ Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles

Cites Work

• Unnamed Item
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• On simultaneous planar graph embeddings
• 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
• Orthogeodesic point-set embedding of trees
• Hamiltonian Orthogeodesic Alternating Paths
• Manhattan-Geodesic Embedding of Planar Graphs
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Drawing Planar Graphs on Area
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles