How to Draw a Graph
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Removing circuits in 3-connected binary matroids
- Long cycles in 4-connected planar graphs
- Minor and minimum cycle bases of a 3-connected planar graph
- Feature-sensitive parameterization of polygonal meshes
- A spherical parameterization approach based on symmetry analysis of triangular meshes
- Graph-encoded 3-manifolds
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Graph graphics: Theory and practice
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
- Rubber bands, convex embeddings and graph connectivity
- Algorithms for plane representations of acyclic digraphs
- Planarity and duality of finite and infinite graphs
- Non-separating induced cycles in graphs
- Duality of infinite graphs
- On the thickness of graphs of given degree
- A variational principle for circle packings.
- Polyhedral embeddings in the projective plane
- A paradigm for robust geometric algorithms
- Area requirement and symmetry display of planar upward drawings
- Drawing the planar dual
- Rigidity and the Alexandrov-Fenchel inequality
- Separation of vertices by a circuit
- Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der Knotenbilder
- Kuratowski-Pontrjagin theorem on planar graphs
- Minimum-width grid drawings of plane graphs
- Advances in the theory and practice of graph drawing
- How to morph tilings injectively
- Topological queries in spatial databases
- Planarity testing in parallel
- Grid embedding of 4-connected plane graphs
- ARC crossing minimization in hierarchical digraphs with tabu search
- Parametrization and smooth approximation of surface triangulations
- Tutte's barycenter method applied to isotopies
- Spring algorithms and symmetry
- Peripheral circuits in infinite binary matroids
- A chain theorem for 4-connected graphs
- Computing IGA-suitable planar parameterizations by polysquare-enhanced domain partition
- A novel local/global approach to spherical parameterization
- An improved force-directed graph layout algorithm based on aesthetic criteria
- Shortest path embeddings of graphs on surfaces
- Dynamic planar embeddings of dynamic graphs
- The complexity of drawing a graph in a polygonal region
- -stars or on extending a drawing of a connected subgraph
- Network alignment by discrete Ollivier-Ricci flow
- The weighted barycenter drawing recognition problem
- Non-embeddable extensions of embedded minors
- Planar minimally rigid graphs and pseudo-triangulations
- Closest paths in graph drawings under an elastic metric
- Closed 2-cell embeddings in the projective plane
- An algorithm for drawing general undirected graphs
- Non-separating cocircuits in binary matroids
- Incremental convex planarity testing
- Graph multidimensional scaling with self-organizing maps
- Data visualization through graph drawing
- Embeddings of planar graphs that minimize the number of long-face cycles
- Cycles in 4-connected planar graphs
- Uniqueness and minimality of large face-width embeddings of graphs
- Drawing planar graphs using the canonical ordering
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Data-driven graph drawing techniques with applications for conveyor systems
- The contributions of W.T. Tutte to matroid theory
- 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
- 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
- Markov models of coarsening in two-dimensional foams with edge rupture
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs
- On polyhedral realization with isosceles triangles
- On inversion-free mapping and distortion minimization
- 3D mesh cutting for high quality atlas packing
- The density of fan-planar graphs
- Hyperbolic barycentric coordinates and applications
- Positive planar satisfiability problems under 3-connectivity constraints
- 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
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Spaces of geodesic triangulations of surfaces
- Simultaneous interior and boundary optimization of volumetric domain parameterizations for IGA
- Robust atlas generation via angle-based segmentation
- Homotopy height, grid-major height and graph-drawing height
- Discrete trace theorems and energy minimizing spring embeddings of planar graphs
- Chromatic number, induced cycles, and non-separating cycles
- Obstructions to a binary matroid being graphic
- 3D volumetric isotopological meshing for finite element and isogeometric based reduced order modeling
- Non-separating cocircuits avoiding some elements
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- Free edge lengths in plane graphs
- A characterization of graphic matroids using non-separating cocircuits
- Mean value coordinates
- Lifting curve parameterization methods to isosurfaces
- A linearized circle packing algorithm
- Skyscraper polytopes and realizations of plane triangulations
- Non-degeneracy of the harmonic structure on Sierpiński gaskets
- On prisms, Möbius ladders and the cycle space of dense graphs
- Quasi-isometric parameterization for texture mapping
- Non-separating cocircuits in matroids
- An experimental comparison of four graph drawing algorithms.
- Convex combination maps over triangulations, tilings, and tetrahedral meshes
- A connected subgraph maintaining high connectivity
This page was built for publication: How to Draw a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5724435)
