Simultaneous graph embedding with bends and circular arcs

DOI10.1016/j.comgeo.2008.05.003zbMath1205.05216OpenAlexW2095134949MaRDI QIDQ955231

Alejandro Estrella-Balderrama, Justin Cappos, Stephen G. Kobourov, J. Joseph Fowler

Publication date: 19 November 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.05.003

zbMATH Keywords

simultaneous embeddingvertex labeled planar graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Drawing trees with perfect angular resolution and polynomial area, Computing upward topological book embeddings of upward planar digraphs, Matched drawability of graph pairs and of graph triples

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Planar graphs and poset dimension
• The book thickness of a graph
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Characterizations of outerplanar graphs
• The thickness of graphs: A survey
• A characterization of level planar graphs
• On embedding an outer-planar graph in a point set
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Bemerkungen zum Vierfarbenproblem
• Radial Level Planarity Testing and Embedding in Linear Time
• Characterization of Unlabeled Level Planar Trees
• Simultaneous Graph Embedding with Bends and Circular Arcs
• Hierarchies and planarity theory
• Geometric Thickness of Complete Graphs
• Level Planar Embedding in Linear Time
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Augmenting Outerplanar Graphs
• The geometric thickness of low degree graphs
• Characterization of Unlabeled Level Planar Graphs
• Simultaneous Geometric Graph Embeddings
• Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
• Graph Drawing
• Convex Maps
• Graph Drawing
• Algorithms and Data Structures
• Embedding planar graphs at fixed vertex locations