Automatic Layout Algorithms Research Articles

Design and Development of an Automatic Layout Algorithm for Laser GNSS RTK.

At the current stage, the automation level of GNSS RTK equipment is low, and manual operation leads to decreased accuracy and efficiency in setting out. To address these issues, this paper has designed an algorithm for automatic setting out that resolves the common problem of reduced accuracy in conventional RTK. First, the calculation of the laser rotation center is conducted using relevant parameters to calibrate the instrument's posture and angle. Then, by analyzing the posture information, the relative position and direction of the instrument to the point to be set out are determined, and the rotation angles in the horizontal and vertical directions are calculated. Following this, the data results are analyzed, and the obtained rotation angles are output to achieve automatic control of the instrument. Finally, a rotating laser composed of servo motors and laser modules is used to control the GNSS RTK equipment to locate the set-out point, thereby determining its position on the ground and displaying it in real-time. Compared to traditional GNSS RTK equipment, the proposed automatic setting out algorithm and the developed GNSS laser RTK equipment reduce the setting out error from 15 mm to 10.3 mm. This reduces the barrier to using GNSS RTK equipment, minimizes human influence, enhances the work efficiency of setting out measurements, and ensures high efficiency and stability under complex conditions.

Algorithm for Automatic Layout of Graphic Language and Its Application in Graphic Design

When using traditional algorithms to describe graphic languages, the results obtained are not accurate due to the lack of strict standards. In this case, the size and position of the graphic display cannot be accurately determined. Aiming at these problems, we propose a new automatic typesetting algorithm for graphic languages. Use the constant method to calculate the display size of buffered images in graphic design. The ant colony algorithm is used to solve the optimal solution, so that the optimal display position of the graphics in the graphic design can be obtained. Graphics are powerful. For example, excellent graphics such as the presentation of forms, the expression and transmission of information, often make people feel relaxed and empathetic, shorten the distance between each other, and make communication smoother. As a result, graphic languages have become an important part of modern graphic design and are used more and more frequently. This paper attempts to analyze the representation of graphic language, aiming to demonstrate its important role in graphic design.

A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology

Designing the layout for complex electromechanical products involves the challenging task of automatically laying out cables. This challenge is particularly pronounced in the case of branch cables, which are more intricate due to their multiple connection terminals and branches. This paper presents a polynomial-time wiring algorithm based on dynamic programming to determine branching point locations in the layout design of cables, given the electrical definition of the wire harness. The method considers various engineering constraints, including obstacle avoidance, wall adherence, minimum bend radius, and gray areas. To validate our method, we implemented a branch cable auto-layout system through secondary development based on the UG platform. The experimental results indicate the effectiveness of our approach, demonstrating promising performance in terms of time and high-quality layouts. This showcases its potential for practical application in cable layout design for complex electromechanical systems.

Application of traditional cultural elements in modern interior design in the era of artificial intelligence

Abstract This paper applies traditional cultural elements to modern interior design and first analyzes the expression types of traditional cultural elements. Secondly, the color and pattern elements in traditional cultural elements are extracted by color matrix and SIFT algorithm, and the pattern and color elements are applied to modern interior design using an intelligent recommendation algorithm. Next, the layout elements of traditional cultural elements are modeled, and the automatic layout algorithm is created to be utilized in modern interior design. Finally, the performance of extracting traditional cultural elements and their application are analyzed. The results show that the recognition rate of various colors is above 0.88, the extraction accuracy of the overall traditional cultural pattern elements is around 0.9, the overall degree of the graphic color element recommendation is greater than 0.88, the hierarchical difference between the traditional cultural layout and the intelligent layout is between [0.001, 0.01], and the functional difference is between (0, 0.02], and all of the automatic layout algorithms can be completed within 0.2s.

Advanced Intelligent Big Data Analytic-Based Automated Layout for Environmental Design Intelligent Sensor Networks

In this paper, through the in-depth study of advanced intelligent extensive data analysis and the design of the model of the environment design automatic layout intelligent sensor network, we realize the environment design intuitive layout smart sensor network based on advanced thoughtful and extensive data analysis. According to the non-beacon-enabling CSMA/CA algorithm of the MAC layer of a single node in intelligent sensor network, the analysis model of the node MAC layer of the innovative sensor network based on the Markov chain is established. The mathematical calculation method of node MAC layer delay is obtained through the analysis and calculation of nodes’ Markov state transfer process in this model. By analyzing the internal composition of design grooming, data support, analysis modeling, and platform in environmental design big data and the relationship between each part, the industrial extensive data analysis modeling method system is formed based on the CRISP-DM model, based on which the demand analysis of the industrial comprehensive data analysis modeling platform is carried out, and the overall architecture of the platform is formed; this paper proposes an automatic layout algorithm based on strategy iteration for each. Each type of environment design is modeled, and the layout scheme is sequentially generated. The applicability, aesthetics, and comfort are considered, but the design information provided by the space contour can be regarded to develop a reasonable layout scheme. The experimental results show the rationality and versatility of the automatic layout schemes, proving the practicality and time-saving nature of the work.

CoSEP: A compound spring embedder layout algorithm with support for ports

This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defined locations on end nodes. Similar to its predecessor, CoSEP also accounts for non-uniform node dimensions and arbitrary levels of nesting via compound nodes. Our experiments show that CoSEP significantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria while running reasonably fast, suitable for use in interactive applications for small to medium-sized (up to 500 nodes) graphs. A complete JavaScript implementation of CoSEP as a Cytoscape.js extension along with a demo page is freely available at https://github.com/iVis-at-Bilkent/cytoscape.js-cosep .

Definition of the Criteria for Layout of the UML Use Case Diagrams

Abstract Nowadays, the topicality and applicability of model-driven development in the object-oriented development approach has increased, so it is important that created models and diagrams display not only the content, but also visually reflect information. Transparent diagram placement that influences work productivity is important for displaying information. Manual layout of diagrams is a time-consuming activity, which can also be ineffective, so in this paper the application of UML use case automatic layout is reviewed. The paper also examines the requirements of use case diagrams and placement criteria, which will serve as a basis for the creation of an automatic use case diagram layout algorithm.

Web3D-based automatic furniture layout system using recursive case-based reasoning and floor field

Furniture layout in a virtual 3D scene is an important and challenging task, as it is time-consuming and requires experience. To address this issue, we propose automatic furniture layout algorithms to help users to rapidly generate reasonable layout results. Specifically, our algorithms divide a scene layout into four layout modes, namely, coupled mode, enclosed mode, matrix mode, and circular mode. Then each model is solved independently. The coupled mode is solved using recursive techniques and case-based reasoning. The enclosed mode is solved using floor field. The distance and angle among the furniture are determined by ergonomics guidelines. Finally, the layout results of the scene can be obtained by combining the solutions from these layout modes, and an evaluation method for the layout results based on user feedback is proposed. For a room with non-rectangular floor, our algorithms can also handle this case using shape standardization techniques. Based on our algorithms, an online 3D furniture layout system is developed. Many experiments are conducted on the system with the real interior design cases, and we compared our algorithms with other popular algorithms. The experimental results show that our algorithms are efficient and can meet the real response requirements of online furniture layout.

Automatic Design Method and Application in Complex Ship Block Lifting

The traditional block lifting schemes often give rise to a host of problems such as the complexity of the lifting process, low degree of automation, and lack of theoretical guidance. To overcome the deficiencies, the authors of this paper have developed an automatic design system for the complex block lifting. Tribon is adopted as the data extraction method to identify the feature area of a block so as to lay out the lifting lugs properly and efficiently. Besides, Matlab is employed to analyze the stress on lifting wires and 3ds Max to simulate the block lifting process. In this way, the potential problems about mechanics and interference between the block and wires can be forecasted so as to enable the designers to improve the lifting scheme and ensure a safer and more reliable design. 1. Introduction Block lifting operation is a crucial process in shipbuilding since it determines the efficiency of the hull construction as well as the quality of the ship. The traditional artificial block lifting schemes often entail a host of problems such as the complexity of the lifting process, low degree of automationand lack of theoretical guidance. in recent years, scholars have studied the block lifting technologies for several types of ships including Very Large crude carrier (VLcc) and the container vessel. After analyzing the features of block lifting operation and the lifting environment, Li et al. (2013) summarized the principles and requirements of block lifting design, built models for the object to be lifted for the lifting equipment as well, designed an automatic layout algorithm for block lifting scheme and developed a design system for ship block lifting. Li et al. (2014) rebuilt the finite element model under ANSYS environment based on the extracted data of blocks. The calculation results can serve as a guidance for the design of structural reinforcement, which can save materials and reduce workload. In terms of the block lifting technologies used in the building of a 3500 TEU container vessel, Zhang (2010) studied on the lifting technologies employed in lifting some typical blocks such as the stern, broadside, and engine room. Based on the analysis and study on hull assembly method, Yu (2014) took use of computer to successfully simulate the process of hull assembly and save the relevant process information about the hull before shipbuilding. Kim et al. (2005) developed the virtual assembly simulation system for shipbuilding, which can simulate the operation of cranes and the installation of blocks in a virtual shipyard and evaluate the operations. Miura (2011) adopted the three-dimensional computer Aided Design (cAD) to develop a simulation system for block lifting and then he illustrated the features and functions of the system and stressed the importance of threedimensional model used in the process. Takola et al. (2013) established a mathematical model to analyze the constraint conditions in the block lifting process so as to optimize the lifting scheme and improve the efficiency of lifting operations. By applying the theory of combined discrete event and discrete time, Cha J.H. developed an integrated simulation framework for block lifting and erection process (Cha et al. 2010; Cha & Roh 2010). KuN. developed a crane system consists of several crane types, a scenario manager capable of creating and editing lifting process for multibody dynamics-based simulation is proposed (Ku et al. 2014a, 2014b). This study focuses on the complex ship block lifting with an attempt to build a system integrating the design of the complex block lifting scheme, the analysis on the mechanical characteristics in the lifting process and the simulation design of the block lifting operation together (Fig. 1).

Interactive Graph Layout of a Million Nodes

Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.

An algorithm for automated layout of process description maps drawn in SBGN.

Motivation: Evolving technology has increased the focus on genomics. The combination of today’s advanced techniques with decades of molecular biology research has yielded huge amounts of pathway data. A standard, named the Systems Biology Graphical Notation (SBGN), was recently introduced to allow scientists to represent biological pathways in an unambiguous, easy-to-understand and efficient manner. Although there are a number of automated layout algorithms for various types of biological networks, currently none specialize on process description (PD) maps as defined by SBGN.Results: We propose a new automated layout algorithm for PD maps drawn in SBGN. Our algorithm is based on a force-directed automated layout algorithm called Compound Spring Embedder (CoSE). On top of the existing force scheme, additional heuristics employing new types of forces and movement rules are defined to address SBGN-specific rules. Our algorithm is the only automatic layout algorithm that properly addresses all SBGN rules for drawing PD maps, including placement of substrates and products of process nodes on opposite sides, compact tiling of members of molecular complexes and extensively making use of nested structures (compound nodes) to properly draw cellular locations and molecular complex structures. As demonstrated experimentally, the algorithm results in significant improvements over use of a generic layout algorithm such as CoSE in addressing SBGN rules on top of commonly accepted graph drawing criteria.Availability and implementation: An implementation of our algorithm in Java is available within ChiLay library (https://github.com/iVis-at-Bilkent/chilay).Contact: ugur@cs.bilkent.edu.tr or dogrusoz@cbio.mskcc.orgSupplementary information: Supplementary data are available at Bioinformatics online.

HOLA: Human-like Orthogonal Network Layout.

Over the last 50 years a wide variety of automatic network layout algorithms have been developed. Some are fast heuristic techniques suitable for networks with hundreds of thousands of nodes while others are multi-stage frameworks for higher-quality layout of smaller networks. However, despite decades of research currently no algorithm produces layout of comparable quality to that of a human. We give a new "human-centred" methodology for automatic network layout algorithm design that is intended to overcome this deficiency. User studies are first used to identify the aesthetic criteria algorithms should encode, then an algorithm is developed that is informed by these criteria and finally, a follow-up study evaluates the algorithm output. We have used this new methodology to develop an automatic orthogonal network layout method, HOLA, that achieves measurably better (by user study) layout than the best available orthogonal layout algorithm and which produces layouts of comparable quality to those produced by hand.

Researching on the Single Lock Chamber Automatic Layout Algorithm

Arrange the ships reasonable as much as possible in the lock chamber, can help improving the traffic ability and the utilization rate of the lock. At present, it is not enough for the factors that considered in the automatic layout algorithm, such as: the safety distance between the ships, ship bottom sill depth. The algorithm can be further optimized. This paper will present a new automatic layout algorithm for single chamber which is able to enhance the efficiency of the chamber space and improve the traffic ability.

CiSE: A Circular Spring Embedder Layout Algorithm

We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named CHISIO.

Biographer: web-based editing and rendering of SBGN compliant biochemical networks

Motivation: The rapid accumulation of knowledge in the field of Systems Biology during the past years requires advanced, but simple-to-use, methods for the visualization of information in a structured and easily comprehensible manner.Results: We have developed biographer, a web-based renderer and editor for reaction networks, which can be integrated as a library into tools dealing with network-related information. Our software enables visualizations based on the emerging standard Systems Biology Graphical Notation. It is able to import networks encoded in various formats such as SBML, SBGN-ML and jSBGN, a custom lightweight exchange format. The core package is implemented in HTML5, CSS and JavaScript and can be used within any kind of web-based project. It features interactive graph-editing tools and automatic graph layout algorithms. In addition, we provide a standalone graph editor and a web server, which contains enhanced features like web services for the import and export of models and visualizations in different formats.Availability: The biographer tool can be used at and downloaded from the web page http://biographer.biologie.hu-berlin.de/. The different software packages, including a server-indepenent version as well as a web server for Windows and Linux based systems, are available at http://code.google.com/p/biographer/ under the open-source license LGPL.Contact: edda.klipp@biologie.hu-berlin.de or handorf@physik.hu-berlin.de

A Comparison of User-Generated and Automatic Graph Layouts

The research presented in this paper compares user-generated and automatic graph layouts. Following the methods suggested by van Ham et al. (2008), a group of users generated graph layouts using both multi-touch interaction on a tabletop display and mouse interaction on a desktop computer. Users were asked to optimize their layout for aesthetics and analytical tasks with a social network. We discuss characteristics of the user-generated layouts and interaction methods employed by users in this process. We then report on a web-based study to compare these layouts with the output of popular automatic layout algorithms. Our results demonstrate that the best of the user-generated layouts performed as well as or better than the physics-based layout. Orthogonal and circular automatic layouts were found to be considerably less effective than either the physics-based layout or the best of the user-generated layouts. We highlight several attributes of the various layouts that led to high accuracy and improved task completion time, as well as aspects in which traditional automatic layout methods were unsuccessful for our tasks.

Visualization Aided Performance Tuning of Irregular Task-Parallel Computations

This paper deals with a visualization-based approach to performance analyzing and tuning of highly irregular task-parallel applications. At its core lies a novel automatic layout algorithm for execution graphs which is based on Sugiyama's framework. Our visualization enables the application designer to reliably detect manifestations of parallel overhead and to investigate on their individual root causes. We particularly focus on structural properties of task-parallel computations which are hard to detect in a more analytical way, for example, false sharing and false parallelism. In addition, we discuss embedding our visualization into an integrated development environment, realizing a seamless work-flow for implementation, execution, analysis, and tuning of parallel programs.

Partitioning and placement for buildable QCA circuits

Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of an electron charge configuration in chemical molecules. In this article, we present the first partitioning and placement algorithm for automatic QCA layout. We identify several objectives and constraints that will enhance the buildability of QCA circuits. The results are intended to: (1) define what is computationally interesting and could actually be built within a set of predefined constraints, (2) project what designs will be possible as additional constructs become realizable, and (3) provide a vehicle that we can use to compare QCA systems to silicon-based systems.

Graph visualization toolkits

The authors have created two toolkits that allow developers to easily integrate graph visualization capabilities into custom software applications. The Graph Layout Toolkit (GLT) provides interfaces for modeling, drawing, and automatically laying out graphs. The Graph Editing Toolkit (GET) provides a customizable display and editing layer, which facilitates rapidly developing tools that visualize data in the form of graphs. The authors present an architectural overview of these tools and discuss the challenges encountered during implementation and integration of theory and research results into such tools, In particular, they discuss automatic graph layout and labeling algorithms and complexity management techniques. In addition, they present examples of applications using these tools.

Empirical Evaluation of Aesthetics-based Graph Layout

Many automatic graph layout algorithms have been designed and implemented to display relational data in a graphical (usually node-arc) manner. The success of these algorithms is typically measured ...