Results 11 to 20 of about 262,244 (186)
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
Layout graph model for semantic façade reconstruction using laser point clouds
Building façades can feature different patterns depending on the architectural style, functionality, and size of the buildings; therefore, reconstructing these façades can be complicated.
Hongchao Fan, Yuefeng Wang, Jianya Gong
doaj +1 more source
Node-attribute graph layout for small-world networks [PDF]
Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs,
Faith, Joe, Gibson, Helen
core +2 more sources
Incremental Grid-like Layout Using Soft and Hard Constraints [PDF]
We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout---with predominantly axis-aligned edges---that is more ...
A. Barsky +15 more
core +1 more source
A Graph Layout Framework Combining t-Distributed Neighbor Retrieval Visualizer and Energy Models
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
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.
Buchsbaum, Adam L. +3 more
openaire +2 more sources
Online Dynamic Network Visualization Based on SIPA Layout Algorithm
Online dynamic network visualization is imperative for real-time network monitoring and analysis applications. It presents a significant research challenge for maintaining both layout stability and quality amid unpredictable temporal changes.
Guijuan Wang +6 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.
Kruiger, JF +5 more
openaire +3 more sources
Visualization of the small world network is an excellent challenge for classic layout algorithm, which is highly connected, resulting in the shape of the hairball.
Cheng Zhan +4 more
doaj +1 more source
Summary: We consider orthogonal upward drawings of directed acyclic graphs with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework. To overcome one of the drawbacks of the Sugiyama Framework, namely, unnecessary edge crossings caused by an unfortunate layer ...
Betz, Gregor +4 more
openaire +2 more sources

