Results 11 to 20 of about 24,958 (160)
Aesthetic Discrimination of Graph Layouts [PDF]
Journal of Graph Algorithms and Applications, 2018 This paper addresses the following basic question: given two layouts of the same graph, which one is more aesthetically pleasing? We propose a neural network-based discriminator model trained on a labeled dataset that decides which of two layouts has a higher aesthetic quality.
Moritz Klammler +2 more
openaire +4 more sources
Rectangular layouts and contact graphs [PDF]
ACM Transactions on Algorithms, 2008 Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding rectangular layouts is a key problem.
Adam L. Buchsbaum +3 more
openaire +2 more sources
A Machine Learning Approach for Predicting Human Preference for Graph Layouts
Journal of Graph Algorithms and Applications, 2022 Understanding what graph layout human prefer and why they prefer such graph layout is significant and challenging due to the highly complex visual perception and cognition system in the human brain.
Shijun Cai +3 more
doaj +1 more source
Circular layout in the Graph Layout toolkit [PDF]
, 1997 The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs. The Circular Library is one of the four styles currently available with the Graph Layout Toolkit. It produces layouts that emphasize natural group structures inherent in a graph's topology, and
Ugur Dogrusöz +2 more
openaire +1 more source
Dynamic Spectral Layout with an Application to Small Worlds
Journal of Graph Algorithms and Applications, 2007 Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach ...
Ulrik Brandes +2 more
doaj +1 more source
Graph drawing using tabu search coupled with path relinking. [PDF]
PLoS ONE, 2018 Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria.
Fadi K Dib, Peter Rodgers
doaj +1 more source
Chic. J. Theor. Comput. Sci., 2015 Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple ...
Vida Dujmovic +2 more
openaire +4 more sources
Computer Graphics Forum, 2017 AbstractWe propose a new graph layout method based on a modification of the t‐distributed Stochastic Neighbor Embedding (t‐SNE) dimensionality reduction technique. Although t‐SNE is one of the best techniques for visualizing high‐dimensional data as 2D scatterplots, t‐SNE has not been used in the context of classical graph layout.
Johannes F. Kruiger +5 more
openaire +3 more sources
A Graph Layout Framework Combining t-Distributed Neighbor Retrieval Visualizer and Energy Models
IEEE Access, 2019 Graph layout investigates the structure of the graph in order to better obtain the information implied in the graph. To solve the shortcomings of dimension reduction layouts on local adjustment and the insufficiency of energy models to maintain the ...
Guangluan Xu +6 more
doaj +1 more source
Prospects of room graph at ‘Seqina’ slum in Egypt
Ain Shams Engineering Journal, 2022 Major problem of fast sprawling slums in Egypt addresses the social study in details. Objective survey study on the micro room-level explores the social structure of building layout.
Ali Essam El Shazly
doaj +1 more source