Results 1 
8 of
8
Fast node overlap removal
 In: Proc. 13th Int. Symp. on Graph Drawing (GD’05). Volume 3843 of LNCS. (2006) 153–164
, 2005
"... Abstract. The problem of node overlap removal is to adjust the layout generated by typical graph drawing methods so that nodes of nonzero width and height do not overlap, yet are as close as possible to their original positions. We give an O(n log n) algorithm for achieving this assuming that the n ..."
Abstract

Cited by 44 (13 self)
 Add to MetaCart
Abstract. The problem of node overlap removal is to adjust the layout generated by typical graph drawing methods so that nodes of nonzero width and height do not overlap, yet are as close as possible to their original positions. We give an O(n log n) algorithm for achieving this assuming that the number of nodes overlapping any single node is bounded by some constant. This method has two parts, a constraint generation algorithm which generates a linear number of “separation ” constraints and an algorithm for finding a solution to these constraints “close ” to the original node placement values. We also extend our constraint solving algorithm to give an active set based algorithm which is guaranteed to find the optimal solution but which has considerably worse theoretical complexity. We compare our method with convex quadratic optimization and force scan approaches and find that it is faster than either, gives results of better quality than force scan methods and similar quality to the quadratic optimisation approach.
Visualizing Graphs with Node and Edge Labels
"... Abstract. When drawing graphs whose edges and nodes contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a postprocessing step. The core problem in removing overlaps lies in retaining the structural information inherent in a l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. When drawing graphs whose edges and nodes contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a postprocessing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a unified node and edge overlap removal algorithm that does well at solving this problem. 1
Examining the Compactness of Automatically Generated Layouts for Practical Diagrams
"... Graph drawing algorithms have important practical applications, e. g. layerbased algorithms for data flow diagram layout in embedded software design and planarizationbased algorithms to layout UML diagrams in software engineering. Most current drawing methods focus on the optimization of aestheti ..."
Abstract
 Add to MetaCart
Graph drawing algorithms have important practical applications, e. g. layerbased algorithms for data flow diagram layout in embedded software design and planarizationbased algorithms to layout UML diagrams in software engineering. Most current drawing methods focus on the optimization of aesthetic criteria such as the number of edge crossings and bends. The aspects of compactness and aspect ratio are often treated with lower priority, but in practice these are important as well. We present computational experiments showing that compactness can become a problem, especially for large and nested diagrams. Furthermore, we discuss possible new research directions.
General
"... We discuss the task of reconstructing the topological map of an environment based on the sequences of locations visited by a mobile agent – this occurs in systems neuroscience, where one runs into the task of reconstructing the global topological map of the environment based on activation patterns o ..."
Abstract
 Add to MetaCart
(Show Context)
We discuss the task of reconstructing the topological map of an environment based on the sequences of locations visited by a mobile agent – this occurs in systems neuroscience, where one runs into the task of reconstructing the global topological map of the environment based on activation patterns of the place coding cells in hippocampus area of the brain. A similar task appears in the context of establishing wifi connectivity maps.
Center for Integrative
"... Topological maps from signals We discuss the task of reconstructing the topological map of an environment based on the sequences of locations visited by a mobile agent. This problem statement naturally appears in certain practical contexts. In systems neuroscience, one runs into the task of reconstr ..."
Abstract
 Add to MetaCart
(Show Context)
Topological maps from signals We discuss the task of reconstructing the topological map of an environment based on the sequences of locations visited by a mobile agent. This problem statement naturally appears in certain practical contexts. In systems neuroscience, one runs into the task of reconstructing the global topological map of the environment based on activation patterns of the place coding cells in hippocampus area of the brain. A similar task appears in the context of establishing wifi connectivity maps and wireless network optimization problems. We show how both cases can be naturally analyzed using notions from mereotopology (specifically the Region Connection Calculus) and graph theoretic notions. The specifics of the algorithms may vary depending on the nature and the quality (completeness) or the character of the available signals (e.g. the signal be selectively sensitive to a particular regional characteristic, such as the direction and the speed of motion). We discuss some problems appearing in this map reconstructing task and outline more general situations and directions of future developments. 1.
Communicated by:
, 2009
"... 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 postprocessing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while mini ..."
Abstract
 Add to MetaCart
(Show Context)
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 postprocessing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while minimizing the additional area required. This paper presents a new node overlap removal algorithm that does well at retaining a graph’s shape while using little additional area and time. As part of the analysis, we consider and evaluate two measures of dissimilarity for two layouts of the same graph. Submitted: