Convex Maps
From MaRDI portal
Cites work
Cited in
(52)- Drawing slicing graphs with face areas
- An algorithm for constructing star-shaped drawings of plane graphs
- Untangling a planar graph
- Planar graphs and poset dimension
- Algorithms for plane representations of acyclic digraphs
- Planarity and duality of finite and infinite graphs
- Area requirement and symmetry display of planar upward drawings
- Drawing the planar dual
- Orienting planar graphs
- Minimum-width grid drawings of plane graphs
- Topological queries in spatial databases
- Convex representations of maps on the torus and other flat surfaces
- Grid embedding of 4-connected plane graphs
- Characterizing and efficiently computing quadrangulations of planar point sets
- Tutte's barycenter method applied to isotopies
- On the area-universality of triangulations
- Incremental convex planarity testing
- Planarity-preserving clustering and embedding for large planar graphs
- Drawing planar graphs using the canonical ordering
- The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Homotopy height, grid-major height and graph-drawing height
- Upward point set embeddings of paths and trees
- Polyline drawings with topological constraints
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Orthogonal cartograms with at most 12 corners per face
- Upward planar drawings on the standing and the rolling cylinders
- Plane Cubic Graphs with Prescribed Face Areas
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- On edge-length ratios of partial 2-trees
- Four-Connected Spanning Subgraphs of Doughnut Graphs
- Polytopes, graphs, and complexes
- Ramsey Theorems for Knots, Links and Spatial Graphs
- Straight-line drawings of 1-planar graphs
- The computational complexity of knot genus in a fixed 3‐manifold
- An annotated review on graph drawing and its applications
- On-line convex planarity testing
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Manipulating weights to improve stress-graph drawings of 3-connected planar graphs
- A linear-time algorithm for drawing a planar graph on a grid
- Linear linkless embeddings: proof of a conjecture by Sachs
- Harborth's conjecture for 4-regular planar graphs
- Automated rendering of multi-stranded DNA complexes with pseudoknots
- A note on isosceles planar graph drawing
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Untangling polygons and graphs
- Barycentric systems and stretchability
- Simultaneous graph embedding with bends and circular arcs
This page was built for publication: Convex Maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5804714)
