How to Draw a Graph
From MaRDI portal
Publication:5724435
DOI10.1112/plms/s3-13.1.743zbMath0115.40805OpenAlexW2082388593WikidataQ29396259 ScholiaQ29396259MaRDI QIDQ5724435
Publication date: 1963
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-13.1.743
Related Items
Rectilinear planar layouts and bipolar orientations of planar graphs ⋮ Cycles in 4-connected planar graphs ⋮ Self-organizing maps for drawing large graphs ⋮ Planarity testing in parallel ⋮ Peripheral circuits in infinite binary matroids ⋮ A chain theorem for 4-connected graphs ⋮ On simultaneous straight-line grid embedding of a planar graph and its dual ⋮ Grid embedding of 4-connected plane graphs ⋮ Computing IGA-suitable planar parameterizations by polysquare-enhanced domain partition ⋮ Non-planar extensions of subdivisions of planar graphs ⋮ Graph graphics: Theory and practice ⋮ Extending convex partial drawings of graphs ⋮ On simultaneous planar graph embeddings ⋮ Uniqueness and minimality of large face-width embeddings of graphs ⋮ Spherical parametrization of genus-zero meshes by minimizing discrete harmonic energy ⋮ Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs ⋮ ARC crossing minimization in hierarchical digraphs with tabu search ⋮ Rubber bands, convex embeddings and graph connectivity ⋮ Acute triangulations of the regular dodecahedral surface ⋮ Drawing polytopal graphs with {\texttt{polymake}} ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Algorithms for plane representations of acyclic digraphs ⋮ Contractible small subgraphs in \(k\)-connected graphs ⋮ A novel local/global approach to spherical parameterization ⋮ Barycentric systems and stretchability ⋮ Parametrization and smooth approximation of surface triangulations ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ Non-separating subgraphs after deleting many disjoint paths ⋮ Removable paths and cycles with parity constraints ⋮ Tutte's barycenter method applied to isotopies ⋮ Shortest path embeddings of graphs on surfaces ⋮ Planarity and duality of finite and infinite graphs ⋮ An analysis and comparison of parameterization-based computation of differential quantities for discrete surfaces ⋮ Dynamic planar embeddings of dynamic graphs ⋮ Graph spectra in computer science ⋮ Small grid embeddings of 3-polytopes ⋮ Non-separating induced cycles in graphs ⋮ Feature-based 3D morphing based on geometrically constrained spherical parameterization ⋮ Non-separating subgraphs in highly connected graphs ⋮ Unique embeddings of simple projective plane polyhedral maps ⋮ Non-separating cycles and discrete Jordan curves ⋮ Embeddings of graphs with no short noncontractible cycles ⋮ Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra ⋮ Non-separating even cycles in highly connected graphs ⋮ Embedding a triangular graph within a given boundary ⋮ Duality of infinite graphs ⋮ The complexity of drawing a graph in a polygonal region ⋮ \(\beta\)-stars or on extending a drawing of a connected subgraph ⋮ Network alignment by discrete Ollivier-Ricci flow ⋮ The weighted barycenter drawing recognition problem ⋮ On the thickness of graphs of given degree ⋮ Contractible triples in highly connected graphs ⋮ A variational principle for circle packings. ⋮ Polyhedral embeddings in the projective plane ⋮ A paradigm for robust geometric algorithms ⋮ Morphing Schnyder drawings of planar triangulations ⋮ A linear-time algorithm for drawing a planar graph on a grid ⋮ Spanning trees with nonseparating paths ⋮ Area requirement and symmetry display of planar upward drawings ⋮ Geometric realization of a triangulation on the projective plane with one face removed ⋮ Non-embeddable extensions of embedded minors ⋮ Straight line triangle representations ⋮ Drawing the planar dual ⋮ A polynomial time circle packing algorithm ⋮ Homogeneity analysis using absolute deviations ⋮ Rigidity and the Alexandrov-Fenchel inequality ⋮ On well-covered triangulations. II. ⋮ Simple and optimal output-sensitive construction of contour trees using monotone paths ⋮ The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits ⋮ Separation of vertices by a circuit ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ Closest paths in graph drawings under an elastic metric ⋮ Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der Knotenbilder ⋮ Kuratowski-Pontrjagin theorem on planar graphs ⋮ Cycle bases of graphs and sampled manifolds ⋮ Closed 2-cell embeddings in the projective plane ⋮ Removing circuits in 3-connected binary matroids ⋮ Long cycles in 4-connected planar graphs ⋮ Minimum-width grid drawings of plane graphs ⋮ An algorithm for drawing general undirected graphs ⋮ Minor and minimum cycle bases of a 3-connected planar graph ⋮ Non-separating cocircuits in binary matroids ⋮ Feature-sensitive parameterization of polygonal meshes ⋮ Advances in the theory and practice of graph drawing ⋮ Spring algorithms and symmetry ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Automatic surface mesh generation for discrete models -- a complete and automatic pipeline based on reparametrization ⋮ A spherical parameterization approach based on symmetry analysis of triangular meshes ⋮ How to morph tilings injectively ⋮ Topological queries in spatial databases ⋮ Drawing plane graphs nicely ⋮ Incremental convex planarity testing ⋮ Graph multidimensional scaling with self-organizing maps ⋮ How to cage an egg ⋮ How to draw a planar graph on a grid ⋮ Data visualization through graph drawing ⋮ Graph-encoded 3-manifolds ⋮ Embeddings of planar graphs that minimize the number of long-face cycles ⋮ Drawing graphs by eigenvectors: theory and practice ⋮ Straight-line drawings of 1-planar graphs ⋮ Morphing triangle contact representations of triangulations ⋮ How to draw a planar clustered graph ⋮ The deformation space of geodesic triangulations and generalized Tutte's embedding theorem ⋮ Cube moves for \(s\)-embeddings and \(\alpha\)-realizations ⋮ Area-preserving parameterization with Tutte regularization ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ An annotated review on graph drawing and its applications ⋮ Theoretical Foundation of the Stretch Energy Minimization for Area-Preserving Simplicial Mappings ⋮ Morphing planar graph drawings through 3D ⋮ Schwarzschild Harmonic Path Planning and Tetrahedral Mesh Smoothing ⋮ Joint optimization of distortion and cut location for mesh parameterization using an Ambrosio-Tortorelli functional ⋮ Statistical embedding: beyond principal components ⋮ On-line convex planarity testing ⋮ Excluded minors for the Klein bottle. II: Cascades ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Embedding stacked polytopes on a polynomial-size grid ⋮ The density of fan-planar graphs ⋮ Planar and Toroidal Morphs Made Easier ⋮ One-to-one piecewise linear mappings over triangulations ⋮ Planar L-Drawings of Bimodal Graphs ⋮ Polygons with Prescribed Angles in 2D and 3D ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Circle packings of maps —The Euclidean case ⋮ Hyperbolic barycentric coordinates and applications ⋮ A characterization of graphic matroids using non-separating cocircuits ⋮ Positive planar satisfiability problems under 3-connectivity constraints ⋮ Graphs, Vectors, and Matrices ⋮ From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs ⋮ Planar and toroidal morphs made easier ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ On the reconstruction of planar graphs ⋮ Mean value coordinates ⋮ Lifting curve parameterization methods to isosurfaces ⋮ A linearized circle packing algorithm ⋮ Polytopes, graphs, and complexes ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Spaces of geodesic triangulations of surfaces ⋮ Drawing planar graphs using the canonical ordering ⋮ Skyscraper polytopes and realizations of plane triangulations ⋮ On convex embeddings of planar 3-connected graphs ⋮ Simultaneous interior and boundary optimization of volumetric domain parameterizations for IGA ⋮ Robust atlas generation via angle-based segmentation ⋮ A Splitting Scheme for Flip-Free Distortion Energies ⋮ Realizing Planar Graphs as Convex Polytopes ⋮ Wachspress and Mean Value Coordinates ⋮ Random walks on mated-CRT planar maps and Liouville Brownian motion ⋮ Feature-aware reconstruction of trimmed splines using Ricci flow with metric optimization ⋮ Non-degeneracy of the harmonic structure on Sierpiński gaskets ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Snapping Graph Drawings to the Grid Optimally ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ How to Draw a Planarization ⋮ Homotopy height, grid-major height and graph-drawing height ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Discrete trace theorems and energy minimizing spring embeddings of planar graphs ⋮ Chromatic number, induced cycles, and non-separating cycles ⋮ Data Structures and their Planar Graph Layouts ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ Nets with collisions (unstable nets) and crystal chemistry ⋮ Quasi-isometric parameterization for texture mapping ⋮ Connected hyperplanes in binary matroids ⋮ The contributions of W.T. Tutte to matroid theory ⋮ How to Draw a Planarization ⋮ Non-separating cocircuits in matroids ⋮ An experimental comparison of four graph drawing algorithms. ⋮ How to Morph Planar Graph Drawings ⋮ Connected hyperplanes in binary matroids ⋮ Discrete Lie flow: a measure controllable parameterization method ⋮ Preventing self-intersection with cycle regularization in neural networks for mesh reconstruction from a single RGB image ⋮ Geometric realization of a triangulation on the projective plane with one face removed ⋮ Sand drawings and Gaussian graphs§ ⋮ Drawing planar graphs with circular arcs ⋮ Computing planar and volumetric B-spline parameterizations for IGA by robust mapping fitting ⋮ 27 variants of Tutte's theorem for plane near-triangulations and an application to periodic spline surface fitting ⋮ A multi-scale algorithm for drawing graphs nicely ⋮ Markov models of coarsening in two-dimensional foams with edge rupture ⋮ Every collinear set in a planar graph is free ⋮ Obstructions to a binary matroid being graphic ⋮ Characterizing 3-connected planar graphs and graphic matroids ⋮ Manifold Intrinsic Similarity ⋮ Convexity-increasing morphs of planar graphs ⋮ Density-Equalizing Maps for Simply Connected Open Surfaces ⋮ Convex combination maps over triangulations, tilings, and tetrahedral meshes ⋮ A connected subgraph maintaining high connectivity ⋮ Aligned Drawings of Planar Graphs ⋮ The Binary Stress Model for Graph Drawing ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Bijective parameterization with free boundaries ⋮ Computing locally injective mappings by advanced MIPS ⋮ Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs ⋮ On polyhedral realization with isosceles triangles ⋮ Removable cycles in non-bipartite graphs ⋮ On inversion-free mapping and distortion minimization ⋮ Morphing Contact Representations of Graphs ⋮ 3D volumetric isotopological meshing for finite element and isogeometric based reduced order modeling ⋮ On the decomposition of a complete graph into planar subgraphs ⋮ A Simple Criterion for Nodal 3-connectivity in Planar Graphs ⋮ Shape convergence for aggregate tiles in conformal tilings ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen ⋮ Planar drawings of fixed-mobile bigraphs ⋮ On Area-Universal Quadrangulations ⋮ Computing Surface Uniformization Using Discrete Beltrami Flow ⋮ 3D mesh cutting for high quality atlas packing ⋮ Polygons with Prescribed Angles in 2D and 3D ⋮ A Tipping Point for the Planarity of Small and Medium Sized Graphs ⋮ Towards a Characterization of Stretchable Aligned Graphs ⋮ Discrete one-forms on meshes and applications to 3D mesh parameterization ⋮ Non-separating cocircuits avoiding some elements ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) ⋮ Nonseparating Cocircuits in Binary Matroids ⋮ Free edge lengths in plane graphs
