Convex Representations of Graphs
From MaRDI portal
Publication:3270981
DOI10.1112/plms/s3-10.1.304zbMath0094.36301OpenAlexW2019912818MaRDI QIDQ3270981
Publication date: 1960
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-10.1.304
Related Items
Embedding stacked polytopes on a polynomial-size grid, The Complexity of Drawing a Graph in a Polygonal Region, Minimum-segment convex drawings of 3-connected cubic plane graphs, Greedy drawings of triangulations, Lifting curve parameterization methods to isosurfaces, Plane Cubic Graphs with Prescribed Face Areas, Cyclically five-connected cubic graphs, Polytopes, graphs, and complexes, Drawing planar graphs using the canonical ordering, Algorithms for plane representations of acyclic digraphs, On convex embeddings of planar 3-connected graphs, Barycentric systems and stretchability, Circumscribing polygons and polygonizations for disjoint line segments, Parametrization and smooth approximation of surface triangulations, Realizing Planar Graphs as Convex Polytopes, The segment number: algorithms and universal lower bounds for some classes of planar graphs, Straight-line drawings of 1-planar graphs, Planarity and duality of finite and infinite graphs, An annotated review on graph drawing and its applications, Small grid embeddings of 3-polytopes, A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners, On-line convex planarity testing, Unveiling the role of differential growth in 3D morphogenesis: an inference method to analyze area expansion rate distribution in biological systems, Conformal tilings I: foundations, theory, and practice, Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, The complexity of drawing a graph in a polygonal region, The weighted barycenter drawing recognition problem, Representations of graphs and networks (coding, layouts and embeddings), Three-dimensional graph drawing, Convex drawings of graphs with non-convex boundary constraints, Nets with collisions (unstable nets) and crystal chemistry, Separation of vertices by a circuit, Planar minimally rigid graphs and pseudo-triangulations, Navigation in spatial networks: a survey, Convex drawings of hierarchical planar graphs and clustered planar graphs, Closest paths in graph drawings under an elastic metric, Triangulating planar graphs while minimizing the maximum degree, Convexity-increasing morphs of planar graphs, Non-convex Representations of Graphs, A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs, Drawing slicing graphs with face areas, On the decomposition of a complete graph into planar subgraphs, A Simple Criterion for Nodal 3-connectivity in Planar Graphs, A note on isosceles planar graph drawing, Algorithms for Drawing Planar p-petal Graphs, Advances in the theory and practice of graph drawing, An algorithm for constructing star-shaped drawings of plane graphs, Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen, Spring algorithms and symmetry, How to morph tilings injectively, On a conjecture related to geometric routing, Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles, Drawing plane graphs nicely, Incremental convex planarity testing, Convex representations of maps on the torus and other flat surfaces, THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
