# Questions tagged [graph-drawing]

The tag has no usage guidance.

11 questions
Filter by
Sorted by
Tagged with
1 vote
22 views

### Visualising pseudo-tree with two parents per node

I have an algorithm that recursively connects together pairs of nodes into new nodes. It looks like the Huffman code algorithm, except that a node can be re-used after it has been part of a merge. The ...
• 141
17 views

### How to avoid drawing dense maps?

The problem I have in hand is like drawing Google Maps by myself, in particular, roads. When my map scale is huge, I face no problem, but when I zoom out there are too many things to draw -- sure, I ...
• 228
22 views

### Machine Learning to draw a topology of elements

I'm exploring the idea of using machine learning to draw a topology of elements. For example, imagine a tree representing geological hierarchy (country -> province -> city). All countries are at ...
141 views

### Algorithm for drawing AST-es?

One of the features the compiler for my programming language is supposed to have is the ability to draw AST-es, to make it easier to detect when syntax doesn't mean exactly what the programmer meant. ...
571 views

### Longest-Path Layering algorithm

NOTES: there are a myriad of graph data structures, I use a spin-off of a directed adjacency hash. the code provide in this post is python3 on the premise that it ...
• 121
342 views

### Semi-automatic layout algorithms for a mind map

There're some existing tree layout algorithms such as Tidier Drawings of Trees and Drawing Non-layered Tidy Trees in Linear Time. I call them as automatic layout algorithms since positions of nodes ...
• 121
63 views

### A 2D Layout Algorithm for Small, Sparse, and Undirected Graphs with a Specific Edge Length

I would like to to draw a graph where every edge $e_m$ has a predefined length of $l$. Given that the graph is small and sparse, it should be feasable. However, I did not manage to find an algorithm ...
• 123
4k views

### Conditions for bipartite graph to be planar with no edges going around the vertices

A bipartite graph is planar iff it has no $K_{3, 3}$ or $K_5$ minors. I am looking for a necessary or/and sufficient conditions to allow planar drawings with no edges "going around" sets of vertices. ...
• 1,787
71 views

### Is there a 2D-layout algorithm for DAGs that allows the positions on one axis to be fixed?

I've got a DAG of around 3.300 vertices which can be laid out quite successfully by dot as a more or less simple tree (things get complicated because vertices can ...