Convex Maps
From MaRDI portal
Publication:5804714
DOI10.2307/2031777zbMath0042.42004OpenAlexW4251805890WikidataQ63253002 ScholiaQ63253002MaRDI QIDQ5804714
Publication date: 1951
Full work available at URL: https://doi.org/10.2307/2031777
Related Items
A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs, Untangling polygons and graphs, Grid embedding of 4-connected plane graphs, On Edge-Length Ratios of Partial 2-Trees, Plane Cubic Graphs with Prescribed Face Areas, Optimal point-set embedding of wheel graphs and a sub-class of 3-trees, Polytopes, graphs, and complexes, Convex grid drawings of planar graphs with constant edge-vertex resolution, Planar graphs and poset dimension, Drawing planar graphs using the canonical ordering, Algorithms for plane representations of acyclic digraphs, The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry, Barycentric systems and stretchability, Orthogonal cartograms with at most 12 corners per face, Upward planar drawings on the standing and the rolling cylinders, Characterizing and efficiently computing quadrangulations of planar point sets, Straight-line drawings of 1-planar graphs, Tutte's barycenter method applied to isotopies, The computational complexity of knot genus in a fixed 3‐manifold, Planarity and duality of finite and infinite graphs, An annotated review on graph drawing and its applications, Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs, A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners, On-line convex planarity testing, Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges, Homotopy height, grid-major height and graph-drawing height, Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints, On the area-universality of triangulations, Upward point set embeddings of paths and trees, A linear-time algorithm for drawing a planar graph on a grid, Area requirement and symmetry display of planar upward drawings, Simultaneous graph embedding with bends and circular arcs, Drawing the planar dual, Orienting planar graphs, Convex grid drawings of planar graphs with constant edge-vertex resolution, Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three, Four-Connected Spanning Subgraphs of Doughnut Graphs, Polyline drawings with topological constraints, Drawing slicing graphs with face areas, Minimum-width grid drawings of plane graphs, A note on isosceles planar graph drawing, Ramsey Theorems for Knots, Links and Spatial Graphs, An algorithm for constructing star-shaped drawings of plane graphs, Untangling a planar graph, Topological queries in spatial databases, Incremental convex planarity testing, Convex representations of maps on the torus and other flat surfaces, Planarity-preserving clustering and embedding for large planar graphs
Cites Work
