Convex Representations of Graphs

Cited in

(57)

Drawing slicing graphs with face areas
An algorithm for constructing star-shaped drawings of plane graphs
Algorithms for plane representations of acyclic digraphs
Planarity and duality of finite and infinite graphs
Representations of graphs and networks (coding, layouts and embeddings)
Separation of vertices by a circuit
Advances in the theory and practice of graph drawing
How to morph tilings injectively
Convex representations of maps on the torus and other flat surfaces
Parametrization and smooth approximation of surface triangulations
Spring algorithms and symmetry
The complexity of drawing a graph in a polygonal region
The weighted barycenter drawing recognition problem
Planar minimally rigid graphs and pseudo-triangulations
Navigation in spatial networks: a survey
Closest paths in graph drawings under an elastic metric
Incremental convex planarity testing
Drawing planar graphs using the canonical ordering
Minimum-segment convex drawings of 3-connected cubic plane graphs
Lifting curve parameterization methods to isosurfaces
Cyclically five-connected cubic graphs
A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
On the decomposition of a complete graph into planar subgraphs
Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen
On a conjecture related to geometric routing
Circumscribing polygons and polygonizations for disjoint line segments
Algorithms for Drawing Planar p-petal Graphs
The point-set embeddability problem for plane graphs
Conformal tilings. I: Foundations, theory, and practice
Realizing planar graphs as convex polytopes
Non-convex Representations of Graphs
Plane Cubic Graphs with Prescribed Face Areas
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
On convex embeddings of planar 3-connected graphs
A simple criterion for nodal 3-connectivity in planar graphs
The complexity of drawing a graph in a polygonal region
Triangulating planar graphs while minimizing the maximum degree
Nets with collisions (unstable nets) and crystal chemistry
Polytopes, graphs, and complexes
Area difference bounds for dissections of a square into an odd number of triangles
Convexity-increasing morphs of planar graphs
A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
The segment number: algorithms and universal lower bounds for some classes of planar graphs
Straight-line drawings of 1-planar graphs
An annotated review on graph drawing and its applications
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
Small grid embeddings of 3-polytopes
Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
Diffeomorphic registration of 3D surfaces with point and curve landmarks
Three-dimensional graph drawing
A note on isosceles planar graph drawing
Drawing plane graphs nicely
Greedy drawings of triangulations
Barycentric systems and stretchability
Convex drawings of graphs with non-convex boundary constraints
Convex drawings of hierarchical planar graphs and clustered planar graphs

This page was built for publication: Convex Representations of Graphs

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