Universal Point Sets for Planar Graph Drawings with Circular Arcs

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Canadian Conference on Computational Geometry

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs

  2012cited by this paper
• Planar Lombardi Drawings for Subcubic Graphs

  2012cited by this paper
• ON HOW TO DRAW A GRAPH

  2012cited by this paper
• On Universal Point Sets for Planar Graphs

  2012cited by this paper
• Universal point sets for planar three-trees

  2012cited by this paper
• I and J

  2012influential reference
• On point-sets that support planar graphs

  2011cited by this paper
• Small Point Sets for Simply-Nested Planar Graphs

  2011cited by this paper
• Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices

  2010cited by this paper
• Computing upward topological book embeddings of upward planar digraphs

  2007cited by this paper
• The Open Problems Project

  2007influential reference
• Curve-constrained drawings of planar graphs

  2005cited by this paper
• A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs

  2004cited by this paper
• Arc diagrams: visualizing structure in strings

  2002cited by this paper
• Embedding a planar triangulation with vertices at specified points

  1991cited by this paper
• How to draw a planar graph on a grid

  1990cited by this paper
• Embedding planar graphs on the grid

  1990cited by this paper
• A lower bound on the size of universal sets for planar graphs

  1989cited by this paper
• DAG—a program that draws directed graphs

  1988cited by this paper
• Small sets supporting fary embeddings of planar graphs

  1988cited by this paper
• Algorithms for Drawing Graphs: an Annotated Bibliography

  1988cited by this paper
• Rectilinear planar layouts and bipolar orientations of planar graphs

  1986cited by this paper
• Planar Embedding of Planar Graphs

  1983cited by this paper
• Permutation procedure for minimising the number of crossings in a network

  1968cited by this paper
• THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS.

  1964cited by this paper
• Bemerkungen zum Vierfarbenproblem.

  1936cited by this paper
• Journal of Graph Algorithms and Applications Superpatterns and Universal Point Sets

  year unknowncited by this paper
• Journal of Graph Algorithms and Applications Lombardi Drawings of Graphs

  year unknowncited by this paper
• Journal of Graph Algorithms and Applications Smooth Orthogonal Layouts

  year unknowncited by this paper

• : About: 2014-2015 Annual Report

  2018cites this paper
• Computing Quasi-Upward Planar Drawings of Mixed Graphs

  2015cites this paper
• Arc diagrams, flip distances, and Hamiltonian triangulations

  2015cites this paper
• A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing

  2014cites this paper
• Achieving Good Angular Resolution in 3D Arc Diagrams

  2013cites this paper
• Small Superpatterns for Dominance Drawing

  2013cites this paper
• Effective Geometric Algorithms for Surfaces and Visibility

  2012cites this paper