检索结果-内蒙古大学图书馆

Automatic layout algorithm for Graphic Language in Visual Communication Design

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2023年第8期14卷 699-708页

作者： Liao, Xiaofang Hu, Xinqian Guangdong Univ Foreign Studies Intelligent Informat Res Inst South China Business Coll Guangzhou 510545 Peoples R China Hunan Univ Technol Zhuzhou 412000 Peoples R China

As computer technology advances, people's capacity for visual perception grows better, and the demands placed on computerized layouts progressively rise. The simple style of graphics is no longer the only option for computer figure video creation;instead, there is a greater tendency to visually represent the effect and improve the aesthetics and expressiveness of visuals and images. Graphic language uses visual components, including shapes, colors, typographies, images, and icons, in a visual communication context to express messages, ideas, and emotions. Graphics language encounters greater chances and obstacles against the backdrop of this information era. Consequently, it is crucial to convert data into graphics language. Visual communication is evolving in some potential directions with the advancement of technological advances and cultural convergence. The graphic language has its distinct visual meaning, and each person's visual experience is extremely diverse and exists in life with various visual elements in different layouts. A hybridized Grid and Content-based Automatic layout (HGC-AL) algorithm for graphic language in Visual Communication Design (VCD) has been developed to produce visually balanced layouts and establish a structured system for arranging content elements. The content-based layout uses design constraints for better alignment and avoids conflict loss. The hierarchical arrangement of graphic elements in a grid layout analyzes the types of visual elements like image, text, and color. Finally, graphic language enhances the visual score and gives flexibility by allowing changes and modifications within the grid layout. Following the design requirements change, the responsive fluid grid supports various graphical content, sizes, and alignments. Thus, compared with existing layout algorithms, the proposed algorithm is validated with metrics like Intersection of Union (IoU), alignment accuracy, content coverage ratio, visual score, scalability rati

关键词： Graphic language visual communication design layout algorithm design elements grid layout content layout

来源：评论

学校读者我要写书评

暂无评论

The Ordered Treemap of Weight Divided layout algorithm

引用

电脑学刊 2019年第5期30卷 31-45页

作者： Bo Yang Weiqun Cao

Existing treemap layout algorithms are inefficient sequentially, while ordered treemap layout algorithms are incapable of squarifying ability and providing continuity. In this paper, we propose a type of ordered treemap of weight divided layout algorithm. The overall idea of the algorithm is to bundle multiple nodes into two nodes with similar weights. Then, the long edge segmentation principle is used to design the rectangular area of the treemap. Through the application of the ＂divide and conquer＂ rule for the new structure of the two power value nodes, the layouts of all the single nodes are accomplished by repeating the above process until completion. We used 50 randomly generated datasets and compared nine types of layout algorithms. The comparison and analysis are made with six indexes for our algorithm. The experimental results show that the algorithm has an advantage in terms of average aspect ratio, continuity, and distance correlation, and that it is suitable for a hierarchical data visualization display that has order requirements.

关键词： hierarchical data layout algorithm ordered treemap square treemap

来源：评论

学校读者我要写书评

暂无评论

A multi-constraint layout algorithm for Dynamic Network Visualization 2

A multi-constraint Layout Algorithm for Dynamic Network Visu...

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Xiaolei Du Yingmei Wei Lingda Wu College of Information System and Management National University of Defense Technology The Key Laboratory Equipment Academy

ISBN: (纸本)9781509036202

Visualizing the evolving process of the dynamic network is a challenge in the Big Data *** addition to presenting network structure at each time step,the layout sequence should preserve user's mental *** this paper,we propose a novel algorithm based on multiple constraints to achieve an aesthetic layout while maintain a coherent mental *** evolution parameter,considering time-space changes in the dynamic process,is presented to restrain nodes' movement and preserve mental *** energy parameter is then applied based on nodes' energy state to achieve a stable and aesthetic *** effectiveness of our method is demonstrated by comparing to previous method using two network data sets.

关键词： network visualization dynamic network layout algorithm

来源：评论

学校读者我要写书评

暂无评论

CiFDAL: A graph layout algorithm to enhance human cognition in Idea Discovery

CiFDAL: A graph layout algorithm to enhance human cognition ...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Wang, Yibo Zhang, Chen Wang, Wei Xu, Fanjiang Wang, Hao Chinese Acad Sci Inst Software Sci & Technol Integrated Informat Syst Lab Beijing 100190 Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100190 Peoples R China

ISBN: (纸本)9781479986965

IdeaGraph is a core component of Idea Discovery, which discovers idea by converting unstructured data into a scenario graph. Since the scenario graph is complex and heterogeneous, the layouts generated by general graph layout algorithms can't well support human cognition. To tackle this issue, a novel graph layout algorithm named CiFDAL is proposed, which is a hybrid of circular layout algorithm and Force-Directed algorithm (FDA). Overall, it places clusters and key nodes on two nested circles, and different hierarchies distinguish their different importance. Specifically, it uses FDA to ensure the related nodes being closer in distance. Additionally, it improves the classical random-initialized FDA by adopting a better initial position set and iterative node-position exchange technique. Experimental results demonstrate the superiority of our algorithm by comparing with several benchmarks implemented in a famous visualization tool - GraphViz.

关键词： Idea Discovery IdeaGraph Scenario graph layout algorithm Human cognition

来源：评论

学校读者我要写书评

暂无评论

New automatic sketching method for planetary gear train

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE 2025年第1期239卷 38-54页

作者： Huang, Xuewen Ye, Zhizheng Xu, Haocong Ye, Bingliang Cui, Rongjiang Sun, Liang Zhejiang Sci Tech Univ Sch Mech Engn 928 Second Ave Hangzhou 310018 Peoples R China Hangzhou Vocat & Tech Coll Special Equipment Inst Hangzhou Peoples R China

At present, the synthesis results of planetary gear train are saved in the form of adjacency matrices. Research on the sketching method of gear train mechanism is lacking. Adjacency matrices are not conducive to the kinematic analysis and evaluation of gear train mechanism. This study presents a new method for automatic sketching of planetary gear trains by generating a gear distribution matrix. The sketching rules of gears and planet carriers are established based on the structure characteristics. The gear is reasonably distributed by analyzing the gear meshing path and gear level. Thereafter, an algorithm of sketching for the planet carrier is proposed to avoid the line crossing between the planet carrier and gears. This study is beneficial in improving the design efficiency of planetary gear trains.

关键词： Automatic sketching planetary gear train gear distribution matrix kinematic sketch of mechanism layout algorithm

来源：评论

学校读者我要写书评

暂无评论

SPEULER: Semantics-preserving Euler Diagrams

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2022年第1期28卷 433-442页

作者： Kehlbeck, Rebecca Goertler, Jochen Wang, Yunhai Deussen, Oliver Univ Konstanz Constance Germany Shandong Univ Jinan Peoples R China

Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods.

关键词： Data visualization Task analysis Faces Semantics layout Guidelines Visualization Euler diagrams Venn diagrams set visualization layout algorithm

来源：评论

学校读者我要写书评

暂无评论

SFFSlib: A Python library for optimizing attribute layouts from micro to macro scales in network visualization

引用

CHINESE PHYSICS B 2025年第5期34卷 124-138页

作者： Zhang, Ke-Chao Jiang, Sheng-Yue Xiao, Jing Shenzhen Technol Univ Coll Big Data & Internet Shenzhen 518118 Peoples R China Univ Sci & Technol China Sch Cyber Sci & Technol Hefei 230026 Peoples R China Dalian Minzu Univ Coll Informat & Commun Engn Dalian 116600 Peoples R China

Complex network modeling characterizes system relationships and structures, while network visualization enables intuitive analysis and interpretation of these patterns. However, existing network visualization tools exhibit significant limitations in representing attributes of complex networks at various scales, particularly failing to provide advanced visual representations of specific nodes and edges, community affiliation attribution, and global scalability. These limitations substantially impede the intuitive analysis and interpretation of complex network patterns through visual representation. To address these limitations, we propose SFFSlib, a multi-scale network visualization framework incorporating novel methods to highlight attribute representation in diverse network scenarios and optimize structural feature visualization. Notably, we have enhanced the visualization of pivotal details at different scales across diverse network scenarios. The visualization algorithms proposed within SFFSlib were applied to real-world datasets and benchmarked against conventional layout algorithms. The experimental results reveal that SFFSlib significantly enhances the clarity of visualizations across different scales, offering a practical solution for the advancement of network attribute representation and the overall enhancement of visualization quality.

关键词： complex network visualization layout algorithm signed network fuzzy community structure social bot network

来源：评论

学校读者我要写书评

暂无评论

Application Research on Automatic Mapping of Distribution Networks Based on Big Data Technology 3

Application Research on Automatic Mapping of Distribution Ne...

引用

3rd IEEE International Conference on Electrical Engineering, Big Data and algorithms, EEBDA 2024

作者： Fan, Litao Bi, Yunchuan Jiang, Jigang Yunnan Power Grid Co. Ltd. Electric Power Science Research Institute Kunming Yunnan China Dehong Power Supply Bureau of Yunnan Power Grid Co. Ltd. Kunming Yunnan China

ISBN: (纸本)9798350380989

To solve the problem of automatic mapping of single line diagrams in distribution networks, a large amount of manual adjustment is required to meet practical requirements. This article is based on automatic mapping of a distribution network in Yunnan. The system introduces machine learning technology from the big data Spark framework to the single line graph layout algorithm, and conducts application research. Firstly, this paper introduces the automatic mapping system's Technical architecture, explaining the application environment of machine learning technology, proposing the construction of a decision tree machine learning model based on the iterative binary tree 3rd generation (ID3) algorithm. The distribution network data is used as training samples to describe the construction process of the decision tree model. Furthermore, the graph adjusted sample data is used as the training set to train the layout algorithm library. The algorithm for the layout angle of the child devices is related to the parent device. Finally, it validates the machine learning model and layout algorithm using a single line diagram data instance of the distribution network. As a result, after machine learning, the generated single line diagram runs horizontally and vertically, with balanced layering of the station building and a reasonable and beautiful layout effect, which proves big data and machine learning technology and shows the effectiveness of application in automatic layout of single line diagrams. © 2024 IEEE.

关键词： Big data Decision Tree layout algorithm Machine learning Single line diagram

来源：评论

学校读者我要写书评

暂无评论

Classification for the Concrete Syntax of Graph-Like Modeling Languages

引用

SN Computer Science 2023年第2期4卷 189页

作者： Wrobel, Gregor Scheffler, Robert Graph Based Engineering Systems Society for the Advancement of Applied Computer Science Volmerstraße 3 Berlin Germany

A classification scheme for Graph-Like Modeling Languages (GLML) is presented in this paper. The novelty of this classifier lies in its application to a meta-model for GLML that deviates from the simple graph model and underlies a large number of GLML. The main goal of using this classification scheme is to support the reuse of layout algorithms for GLML. GLML are used directly or indirectly for the development of software by model-based software engineering techniques. In other domains, graph-like models are artifacts (e.g., circuit diagrams, energy flow diagrams) that serve as input for downstream specialized applications (simulators, optimizers). The concrete syntax of a language for creating, editing, and understanding models is highly important for the development of modeling tools. layout methods for the used languages have to be implemented to achieve software tools with good usability. Developing layout algorithms is a complex topic that is covered by the specialized field of Graph Drawing. However, there is no existing procedure to determine which layout algorithm can be used for a GLML. Matching layout algorithms to GLML can be achieved by applying the presented classification scheme. © 2023, The Author(s).

关键词： Concrete syntax of modeling languages Domain-specific modeling Graph-like modeling languages Graph drawing layout algorithm

来源：评论

学校读者我要写书评

暂无评论

Aesthetics and Ordering in Stacked Area Charts 12th

Aesthetics and Ordering in Stacked Area Charts

引用

12th International Conference on the Theory and Application of Diagrams (Diagrams)

作者： Mathiesen, Steffen Strunge Schulz, Hans-Jorg Aarhus Univ Dept Comp Sci Abogade 34 DK-8200 Aarhus Denmark

ISBN: (纸本)9783030860622;9783030860615

Stacked area charts are a common visualisation type for sets of time series. Yet, they are also known to be challenging to read, in particular if the time series exhibit much fluctuation or even abrupt changes. In this paper, we introduce a novel approach to improving the layout of stacked area charts by means of reordering the time series in the stack. This approach breaks down into two parts: First, we gather aesthetic criteria and define associated quality metrics for stacked area charts. Second, we use these quality metrics together with a new algorithm called UpwardsOpt to find orderings of the stacked time series that optimise a chart's aesthetic properties. The produced orderings guarantee optimality in the sense that no better result can be obtained by moving any individual time series to a different position in the stack. In a benchmark study, we show that our algorithm can increase the layout quality up to 25%-50% over the state-of-the-art approach at the expense of longer runtimes. All datasets and an open source implementation of our algorithm are provided to facilitate their reuse and the reproducibility of our results.

关键词： Time series visualisation Stacked graphs layout algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：