Results 11 to 20 of about 21,630 (299)
On graph-based design of floor layouts
Knowledge-based tools assisting the designer in engineering represent further improvement of expert systems. The present paper shows how such software can be developed in the particular domain of floor layout design for buildings.
Adam Borkowski+2 more
doaj +4 more sources
Spherical Layout for 3D Graph Visualization
The goal of this work was centered in the graph visualization. The hope is that the extra dimension would give, literally, more space, and that this would ease the problem of displaying large structures.
Martín Leonardo Larrea
doaj +2 more sources
The design of the progressive die stamping process is optimized through minimizing the number of die stamping stations in the strip layout to reduce the die cost.
Aly Shady+3 more
doaj +1 more source
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.
Stephen G. Kobourov+7 more
openaire +4 more sources
The Perception of Graph Properties in Graph Layouts [PDF]
AbstractWhen looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms ...
Soni, Utkarsh+5 more
openaire +3 more sources
Aesthetic Discrimination of Graph Layouts [PDF]
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.
Klammler, M., McHedlidze, T., Pak, A.
openaire +4 more sources
Layout of random circulant graphs [PDF]
A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{ 1,\ldots,\lceil\frac{n-1}{2}\rceil\right\} . A random circulant graph results from deleting edges of H with probability 1-p.
Sebastian Richter, Israel Rocha
openaire +4 more sources
Graph drawing using tabu search coupled with path relinking. [PDF]
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
Rectangular layouts and contact graphs [PDF]
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.
Cecilia M. Procopiuc+3 more
openaire +3 more sources
Multivariate Network Layout Using Force-Directed Method with Attribute Constraints
Graph visualization with proper layout is widely applied to understand the relationship between entities in a complex system and the topological structure information is mainly used. Real-world graphs often have the community structures property which is
Zhuang Xu+4 more
doaj +1 more source