Questions tagged [graph-drawing]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
2 votes
2 answers

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 ...
0 votes
1 answer

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 ...
0 votes
1 answer

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 ...
0 votes
0 answers

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 ...
1 vote
0 answers

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. ...
4 votes
2 answers

Embedding a general planar graph into a grid

I have here a little problem with my homework, and would appreciate some direction. I am attempting for some time now to show that every planar graph is embeddable into a grid (As large as needs be). ...
2 votes
0 answers

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 ...
2 votes
1 answer

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 ...
9 votes
2 answers

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. ...
0 votes
0 answers

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 ...
3 votes
1 answer

Equivalent Straight Line Embedding of a Planar Graph Drawing on a Grid

An embedding of a graph G on a surface Σ is a representation of G on Σ in which points of Σ are associated to vertices and simple arcs are associated to edges in such a way that: the endpoints of ...