Simultaneous graph embedding with bends and circular arcs

DOI10.1016/J.COMGEO.2008.05.003MaRDI QIDQ955231zbMATH OpenOpenAlexFDO

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

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

Graph algorithms (graph-theoretic aspects) (05C85) 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)

Recommendations

• Simultaneous Graph Embedding with Bends and Circular Arcs
• Graph Drawing
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous Embedding with Two Bends per Edge in Polynomial Area
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES

Cites work

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

Cited in

(8)

• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Simultaneous Embedding with Two Bends per Edge in Polynomial Area
• Simultaneous embeddings with vertices mapping to pre-specified points
• Matched drawability of graph pairs and of graph triples
• Simultaneous Graph Embedding with Bends and Circular Arcs
• Computing upward topological book embeddings of upward planar digraphs
• Drawing trees with perfect angular resolution and polynomial area
• Drawing Simultaneously Embedded Graphs with Few Bends

This page was built for publication: Simultaneous graph embedding with bends and circular arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955231)