When drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures
Diagrams, we mean practical graphs where nodes vary in shape and size, have been widely used in soft...
Abstract. Most graph layout algorithms treat nodes as points. The problem of node overlap removal is...
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualiz...
Abstract. When drawing graphs whose edges and nodes contain text or graphics, such information needs...
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs....
Our recent paper [1] details an algorithm for removing overlap between rectangles, while attempting...
Cluttered drawings of graphs cannot e#ectively convey the information of graphs. Two issues might ca...
Graphs where each node includes an amount of text are often used in applications. A typical example ...
The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynam...
Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of no...
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualiz...
International audienceWhile many graph drawing algorithms consider nodes as points, graph visualizat...
Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of no...
The algorithms for removing edge-node intersections in drawings of graphs were analyzed. The nodes w...
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust...
Diagrams, we mean practical graphs where nodes vary in shape and size, have been widely used in soft...
Abstract. Most graph layout algorithms treat nodes as points. The problem of node overlap removal is...
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualiz...
Abstract. When drawing graphs whose edges and nodes contain text or graphics, such information needs...
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs....
Our recent paper [1] details an algorithm for removing overlap between rectangles, while attempting...
Cluttered drawings of graphs cannot e#ectively convey the information of graphs. Two issues might ca...
Graphs where each node includes an amount of text are often used in applications. A typical example ...
The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynam...
Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of no...
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualiz...
International audienceWhile many graph drawing algorithms consider nodes as points, graph visualizat...
Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of no...
The algorithms for removing edge-node intersections in drawings of graphs were analyzed. The nodes w...
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust...
Diagrams, we mean practical graphs where nodes vary in shape and size, have been widely used in soft...
Abstract. Most graph layout algorithms treat nodes as points. The problem of node overlap removal is...
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualiz...
DOI
Add to ORKG