Pages that link to "Item:Q804582"

The following pages link to How to draw a planar graph on a grid (Q804582):

Displaying 50 items.

• Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
• Outer 1-planar graphs (Q289919) (← links)
• Recognizing and drawing IC-planar graphs (Q290513) (← links)
• Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
• Reprint of: ``Grid representations and the chromatic number'' (Q390168) (← links)
• Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
• Acyclic coloring with few division vertices (Q396683) (← links)
• 4-labelings and grid embeddings of plane quadrangulations (Q418877) (← links)
• Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
• Drawing trees in a streaming model (Q436551) (← links)
• Pointed drawings of planar graphs (Q452448) (← links)
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
• The within-strip discrete unit disk cover problem (Q528480) (← links)
• On the red/blue spanning tree problem (Q534557) (← links)
• Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
• Small grid embeddings of 3-polytopes (Q629826) (← 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 note on Schnyder's theorem (Q634746) (← links)
• A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
• A duality transform for constructing small grid embeddings of 3d polytopes (Q679743) (← links)
• Small grid drawings of planar graphs with balanced partition (Q695321) (← links)
• Curve-constrained drawings of planar graphs (Q706719) (← links)
• Green's theorem and isolation in planar graphs (Q714498) (← links)
• The partial visibility representation extension problem (Q724235) (← links)
• Zen puzzle garden is NP-complete (Q763503) (← 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)
• On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
• On simultaneous planar graph embeddings (Q857060) (← links)
• Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
• Are there any good digraph width measures? (Q896003) (← links)
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
• Long alternating paths in bicolored point sets (Q941368) (← links)
• Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
• Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
• Open rectangle-of-influence drawings of inner triangulated plane graphs (Q1016532) (← links)
• Small area drawings of outerplanar graphs (Q1024211) (← links)
• A simple recognition of maximal planar graphs (Q1029086) (← links)
• Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
• A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
• Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← links)
• Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
• Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
• Minimum-width grid drawings of plane graphs (Q1265328) (← links)
• Advances in the theory and practice of graph drawing (Q1285778) (← links)
• Grid embedding of 4-connected plane graphs (Q1355197) (← links)
• Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
• New results on drawing angle graphs (Q1384188) (← links)