The following pages link to Convex Representations of Graphs (Q3270981):
Displaying 50 items.
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Barycentric systems and stretchability (Q885280) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Separation of vertices by a circuit (Q1218436) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- How to morph tilings injectively (Q1300801) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- Parametrization and smooth approximation of surface triangulations (Q1392044) (← links)
- Spring algorithms and symmetry (Q1575440) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- The weighted barycenter drawing recognition problem (Q1725791) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Navigation in spatial networks: a survey (Q1782452) (← links)
- Closest paths in graph drawings under an elastic metric (Q1784072) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- Lifting curve parameterization methods to isosurfaces (Q2388593) (← links)
- Cyclically five-connected cubic graphs (Q2396896) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- On the decomposition of a complete graph into planar subgraphs (Q2541350) (← links)
- Automatische Abbildung eines planaren Graphen in einen ebenen Streckengraphen (Q2560417) (← links)
- On a conjecture related to geometric routing (Q2575088) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Algorithms for Drawing Planar p-petal Graphs (Q2831832) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Conformal tilings I: foundations, theory, and practice (Q2968479) (← links)
- Realizing Planar Graphs as Convex Polytopes (Q3223957) (← links)
- Non-convex Representations of Graphs (Q3611875) (← links)
- Plane Cubic Graphs with Prescribed Face Areas (Q4291195) (← links)
- On convex embeddings of planar 3-connected graphs (Q4946547) (← links)
- A Simple Criterion for Nodal 3-connectivity in Planar Graphs (Q4982066) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- Nets with collisions (unstable nets) and crystal chemistry (Q5406857) (← links)
- Polytopes, graphs, and complexes (Q5612292) (← links)
- Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles (Q5857573) (← links)
