Strictly convex drawings of planar graphs
zbMATH Open1108.05065MaRDI QIDQ863697FDOQ863697
Authors: Imre Bárány, Günter Rote 
Publication date: 5 February 2007
Published in: Documenta Mathematica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/53043
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cited In (35)
- Drawing HV-Restricted Planar Graphs
- Bijections for Baxter families and related objects
- Flip distance between two triangulations of a point set is NP-complete
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Strict Confluent Drawing
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Monotone drawings of 3-connected plane graphs
- Convexity-increasing morphs of planar graphs
- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
- Non-convex Representations of Graphs
- Graph Drawing
- Straight-line drawings of 1-planar graphs
- Embedding stacked polytopes on a polynomial-size grid
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- Pointed drawings of planar graphs
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Strictly-convex drawings of 3-connected planar graphs
- Schnyder woods and orthogonal surfaces
- Realizing planar graphs as convex polytopes
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs
- Small grid embeddings of 3-polytopes
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- A simple criterion for nodal 3-connectivity in planar graphs
- Strictly-convex drawings of 3-connected planar graphs
- Obedient plane drawings for disk intersection graphs
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- Skyscraper polytopes and realizations of plane triangulations
- Upward Planar Drawings and Switch-regularity Heuristics
- Orthogonal surfaces and their CP-orders
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Title not available (Why is that?)
- Monotone drawings of graphs with few directions
- Adjacency graphs of polyhedral surfaces
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- A duality transform for constructing small grid embeddings of 3d polytopes
This page was built for publication: Strictly convex drawings of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863697)
