Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout
Explore this paper's citation graph
Summary
Initial results show this to be a promising technique for positioning graph nodes on a surface and may form the basis of a more general approach for problems involving multi-criteria spatial optimisation.
- Type
- article
- Published
- 1998-10-01
- Cited by
- 13
- References
- 22
- Access
- Open access
- OpenAlex
- https://openalex.org/W50553186
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:7666562
Keywords
Graph, Graph Layout, Computer science, Representation (politics), Genetic algorithm
References
- A Genetic Algorithm for Survivable Network Design
- Genetic Algorithms and the Analysis of Spatially Referenced Data
- Algorithms for Drawing Graphs: an Annotated Bibliography
- Drawing graphs nicely using simulated annealing
- Flexible ligand docking using a genetic algorithm
- An Overview of Evolutionary Algorithms in Multiobjective Optimization
- Automating the layout of network diagrams with specified visual organization
- Finding Acceptable Solutions in the Pareto-Optimal Range using Multiobjective Genetic Algorithms
- A Heuristic for Graph Drawing
- Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem
- Validating Graph Drawing Aesthetics
- Network Optimization Using Evolutionary Strategies
- Discovering patterns in spatial data using evolutionary programming
- An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
- some-A Standard GA Approach to Native Protein Conformation Prediction
Cited by
- Visualizing set relations and cardinalities using Venn and Euler diagrams
- Decomposition-Based Assembly Synthesis for Structural Modularity
- Parallel Single and Multiple Objectives Genetic Algorithms: A Survey
- Layout metrics for Euler diagrams
- Decomposition-Based Assembly Synthesis of Multiple Structures for Minimum Production Cost
- Experimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing Problem
- Sequential and parallel algorithms for low-crossing graph drawing
- Improving automated layout techniques for the production of schematic diagrams
- Decomposition -based assembly synthesis of family of structures.
- A method for graph drawing utilising patterns
- Computing Fast and Scalable Table Cartograms for Large Tables
- Decomposition-Based Assembly Synthesis for Structural
- Graph Drawing Techniques for Geographic Visualization
- Evolutionary Multi-Objective Algorithms
Related papers
- A graph representation for search-based approaches to graph layout problems
- A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
- Multi-Level Graph Layout on the GPU
- CiFDAL: A Graph Layout Algorithm to Enhance Human Cognition in Idea Discovery
- A Scalable Algorithm for Adjusting Node-Node Overlaps
- Efficient Parallel Algorithms for Two Graph Layout Problems
- Building blocks for graph based network analysis