scientific article; zbMATH DE number 432759

zbMATH Open0786.05029MaRDI QIDQ3138887FDOQ3138887

Authors: Walter Schnyder 

Publication date: 15 December 1993

Title of this publication is not available (Why is that?)

Recommendations

• How to draw a planar graph on a grid
• A linear-time algorithm for drawing a planar graph on a grid
• A linear-time algorithm for drawing a planar graph on an \((n-2)\times (n-2)\) grid.
• Grid embedding of 4-connected plane graphs
• Compact visibility representation and straight-line grid embedding of plane graphs.

zbMATH Keywords

gridembeddingplane graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (only showing first 100 items - show all)

• A simple routing algorithm based on Schnyder coordinates
• Some provably hard crossing number problems
• An Algorithm to Construct Greedy Drawings of Triangulations
• Bijections for Baxter families and related objects
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
• Competitive routing in the half-\(\theta_6\)-graph
• Acyclic coloring with few division vertices
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding
• A compact encoding of plane triangulations with efficient query supports
• Unified bijections for maps with prescribed degrees and girth
• A Compact Encoding of Plane Triangulations with Efficient Query Supports
• On Planar Polyline Drawings
• Upward straight-line embeddings of directed graphs into point sets
• Monotone drawings of 3-connected plane graphs
• 4-labelings and grid embeddings of plane quadrangulations
• Minimum-width grid drawings of plane graphs
• Improved floor-planning of graphs via adjacency-preserving transformations
• Point-set embeddings of plane \(3\)-trees
• Planar orientations with low out-degree and compaction of adjacency matrices
• Outer 1-planar graphs
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Planar minimally rigid graphs and pseudo-triangulations
• Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth
• Separation dimension of graphs and hypergraphs
• New results on drawing angle graphs
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• Greedy drawings of triangulations
• Intervals in Catalan lattices and realizers of triangulations
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
• Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
• A linear-time algorithm for drawing a planar graph on a grid
• Pointed drawings of planar graphs
• Green's theorem and isolation in planar graphs
• Succinct representation of labeled graphs
• Improved visibility representation of plane graphs
• Schnyder woods and orthogonal surfaces
• Small area drawings of outerplanar graphs
• Area requirement and symmetry display of planar upward drawings
• A note on optimal area algorithms for upward drawings of binary trees
• Adjacency posets of planar graphs
• Triangulations without pointed spanning trees
• Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
• Visibility representation of plane graphs via canonical ordering tree
• Area-efficient planar straight-line drawings of outerplanar graphs
• Transversal structures on triangulations: A combinatorial study and straight-line drawings
• Advances in the theory and practice of graph drawing
• Planar polyline drawings via graph transformations
• Drawing the planar dual
• Small grid embeddings of 3-polytopes
• Planar graphs, via well-orderly maps and trees
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• Triangulating planar graphs while minimizing the maximum degree
• On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
• Schnyder decompositions for regular plane graphs and application to drawing
• On minimal-node-cost planar embeddings
• Drawing planar graphs using the canonical ordering
• Drawing planar graphs with few geometric primitives
• Strictly-convex drawings of 3-connected planar graphs
• Computing cartograms with optimal complexity
• Area requirement of graph drawings with few crossings per edge
• Decidability of string graphs
• On partitioning the edges of 1-plane graphs
• Euclidean greedy drawings of trees
• Incremental convex planarity testing
• On the edge-length ratio of planar graphs
• Monotone drawings of graphs with few directions
• The strength of weak proximity
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• On the area requirements of planar greedy drawings of triconnected planar graphs
• Good spanning trees in graph drawing
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• Upward Straight-Line Embeddings of Directed Graphs into Point Sets
• Orthogonal cartograms with at most 12 corners per face
• Reprint of: ``Grid representations and the chromatic number
• Upward planar drawings on the standing and the rolling cylinders
• A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
• A Note on Universal Point Sets for Planar Graphs
• The efficient recognition on net-extensibility of graphs
• Title not available (Why is that?)
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• On the Number of α-Orientations
• Robust self-assembly of graphs
• Small grid drawings of planar graphs with balanced partition
• Grid embedding of 4-connected plane graphs
• On simultaneous straight-line grid embedding of a planar graph and its dual
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• Triangulating planar graphs while minimizing the maximum degree
• Small point sets for simply-nested planar graphs
• Orthogonal drawings based on the stratification of planar graphs
• Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
• A local characterization for perfect plane near-triangulations
• On local transformations in plane geometric graphs embedded on small grids
• Characterizing planar tanglegram layouts and applications to edge insertion problems
• Small universal point sets for \(k\)-outerplanar graphs
• Drawing planar graphs on \(\frac{8}{9}n^2\) area

This page was built for publication:

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