Results 61 to 70 of about 260,743 (188)
Exploring Local Optima in Schematic Layout [PDF]
, 2013 In search-based graph drawing methods there are typically a number of parameters that control the search algorithm. These parameters do not affect the ?tness function, but nevertheless have an impact on the ?nal layout. One such search method is hill
Chivers, Daniel, Rodgers, Peter
core
Product recognition in store shelves as a sub-graph isomorphism problem
, 2017 The arrangement of products in store shelves is carefully planned to maximize sales and keep customers happy. However, verifying compliance of real shelves to the ideal layout is a costly task routinely performed by the store personnel. In this paper, we
DG Lowe +8 more
core +1 more source
Graphs from Features: Tree-Based Graph Layout for Feature Analysis
Algorithms, 2020 Feature Analysis has become a very critical task in data analysis and visualization. Graph structures are very flexible in terms of representation and may encode important information on features but are challenging in regards to layout being adequate ...
Rosane Minghim +4 more
doaj +1 more source
Solar farm cable layout optimization as a graph problem
Energy Informatics, 2022 We introduce the Solar Farm Cable Layout Problem (SoFaCLaP), a novel graph-theoretic optimization problem. SoFaCLaP formalizes the task of finding a cost-optimal cable layout in a solar farm where PV string positions are already determined but the ...
Sascha Gritzbach +2 more
doaj +1 more source
Linear Layouts of Bipartite Planar Graphs
, 2023 A linear layout of a graph $ G $ consists of a linear order $\prec$ of the vertices and a partition of the edges. A part is called a queue (stack) if no two edges nest (cross), that is, two edges $ (v,w) $ and $ (x,y) $ with $ v \prec x \prec y \prec w $ ($ v \prec x \prec w \prec y $) may not be in the same queue (stack).
Förster, Henry +6 more
openaire +3 more sources
Perceptual Organization in User-Generated Graph Layouts [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2008 Many graph layout algorithms optimize visual characteristics to achieve useful representations. Implicitly, their goal is to create visual representations that are more intuitive to human observers. In this paper, we asked users to explicitly manipulate nodes in a network diagram to create layouts that they felt best captured the relationships in the ...
Ham, van, F.J.J., Rogowitz, B.
openaire +2 more sources
BioData Mining, 2012 Background Graph drawing is an integral part of many systems biology studies, enabling visual exploration and mining of large-scale biological networks.
Tuikkala Johannes +4 more
doaj +1 more source
Graph layout adjustment strategies [PDF]
, 1996 When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used to create fisheye views of nested graphs is introduced.
Margaret -Anne D. Storey +1 more
openaire +1 more source
Persistent Homology Guided Force-Directed Graph Layouts
, 2019 Graphs are commonly used to encode relationships among entities, yet their abstractness makes them difficult to analyze. Node-link diagrams are popular for drawing graphs, and force-directed layouts provide a flexible method for node arrangements that ...
Hajij, Mustafa +4 more
core +1 more source
Linear orderings of random geometric graphs (extended abstract) [PDF]
, 1999 In random geometric graphs, vertices are randomly distributed on [0,1]^2 and pairs of vertices are connected by edges whenever they are sufficiently close together.
Díaz Cort, Josep +3 more
core +1 more source