Results 21 to 30 of about 24,958 (160)
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
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
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
We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments
Michael Bekos +3 more
doaj +1 more source
Distributed Graph Layout with Spark [PDF]
This paper presents a novel way to draw very large graphs, especially those too big to fit the memory of a single computer. This new method takes advantage of the recent progress in distributed computing, notably using the Apache MapReduce library called Spark.
Hinge, Antoine, Auber, David
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
A Multilevel Algorithm for Force-Directed Graph-Drawing
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated ...
Chris Walshaw
doaj +1 more source
Feasible Sanitary Sewer Network Generation Using Graph Theory
A graph theory-based methodology is proposed for the sewer system optimization problem in this study. Sewer system optimization includes two subproblems: layout optimization and hydraulic design optimization, which can be solved independently or solved ...
Mustafa Erkan Turan +3 more
doaj +1 more source
Parameterized Algorithms for Queue Layouts
An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ sets, called queues, such that no two independent edges of the same queue nest.
Sujoy Bhore +3 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 ...
Gregor Betz +4 more
openaire +2 more sources

