The following pages link to Convex Maps (Q5804714):
Displaying 46 items.
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges (Q634247) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- Barycentric systems and stretchability (Q885280) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Drawing the planar dual (Q1198002) (← links)
- Orienting planar graphs (Q1222167) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- On the area-universality of triangulations (Q1725766) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry (Q1926115) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three (Q3611877) (← links)
- Plane Cubic Graphs with Prescribed Face Areas (Q4291195) (← links)
- On Edge-Length Ratios of Partial 2-Trees (Q5072225) (← links)
- Four-Connected Spanning Subgraphs of Doughnut Graphs (Q5452160) (← links)
- Polytopes, graphs, and complexes (Q5612292) (← links)
- Ramsey Theorems for Knots, Links and Spatial Graphs (Q5753224) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- The computational complexity of knot genus in a fixed 3‐manifold (Q6075064) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
