Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (2)

Search Parameters:
Keywords = Fruchterman–Reingold layout

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
13 pages, 3698 KiB  
Tutorial
Detailed Examples of Figure Preparation in the Two Most Common Graph Layouts
by Izolda Gorgol and Hubert Salwa
Appl. Sci. 2025, 15(5), 2645; https://doi.org/10.3390/app15052645 - 1 Mar 2025
Viewed by 804
Abstract
Graphs are an excellent tool with applications in various branches of engineering. Graph layouts have emerged as a cornerstone in the visual representation and analysis of complex systems. They are indispensable in reducing complexity, optimizing designs, improving communication, and enhancing problem-solving capabilities. They [...] Read more.
Graphs are an excellent tool with applications in various branches of engineering. Graph layouts have emerged as a cornerstone in the visual representation and analysis of complex systems. They are indispensable in reducing complexity, optimizing designs, improving communication, and enhancing problem-solving capabilities. They transform abstract concepts and data into visual formats that are easier to interpret, analyze, and apply in real-world engineering challenges. Therefore, many graph layouts are designed for various purposes. It is not easy to choose the most appropriate one. There are a number of surveys on this subject, but they are descriptive ones. In this paper, we focus on the two most versatile—and therefore most widely used—layouts, namely Fruchterman–Reingold and ForceAtlas2, and show their possibilities in a visual way. We compare how the drawings appear while using various settings of the available options. This helps to choose an appropriate set of settings in practice. Full article
(This article belongs to the Special Issue Data Analysis and Data Mining for Knowledge Discovery)
Show Figures

Figure 1

17 pages, 3731 KiB  
Article
Fruchterman–Reingold Hexagon Empowered Node Deployment in Wireless Sensor Network Application
by Jiahao Li, Yuhao Tao, Kai Yuan, Rongxin Tang, Zhiming Hu, Weichao Yan and Shiyun Liu
Sensors 2022, 22(14), 5179; https://doi.org/10.3390/s22145179 - 11 Jul 2022
Cited by 1 | Viewed by 2401
Abstract
Internet of Things (IoT) and Big Data technologies are becoming increasingly significant parts of national defense and the military, as well as in the civilian usage. The proper deployment of large-scale wireless sensor network (WSN) provides the foundation for these advanced technologies. Based [...] Read more.
Internet of Things (IoT) and Big Data technologies are becoming increasingly significant parts of national defense and the military, as well as in the civilian usage. The proper deployment of large-scale wireless sensor network (WSN) provides the foundation for these advanced technologies. Based on the Fruchterman–Reingold graph layout, we propose the Fruchterman–Reingold Hexagon (FR-HEX) algorithm for the deployment of WSNs. By allocating edges of hexagonal topology to sensor nodes, the network forms hexagonal network topology. A comprehensive evaluation of 50 simulations is conducted, which utilizes three evaluation metrics: average moving distance, pair correlation diversion (PCD), and system coverage rate. The FR-HEX algorithm performs consistently, the WSN topologies are properly regulated, the PCD values are below 0.05, and the WSN system coverage rate reaches 94%. Simulations involving obstacles and failed nodes are carried out to explore the practical applicability of the FR-HEX algorithm. In general, the FR-HEX algorithm can take full advantage of sensors’ hardware capabilities in the deployment. It may be a viable option for some IoT and Big Data applications in the near future. Full article
(This article belongs to the Special Issue Wireless Sensor Networks in Industrial Applications)
Show Figures

Figure 1

Back to TopTop