Some Specification and Proof Steps of a Spanning Tree Algorithm with an Object-Oriented Method

Author(s):  
L. Bonnet ◽  
L. Duchien ◽  
G. Florin ◽  
L. Seinturier
2021 ◽  
Vol 3 (6) ◽  
Author(s):  
Yanrenthung Odyuo ◽  
Dipu Sarkar ◽  
Lilika Sumi

Abstract The development and planning of optimal network reconfiguration strategies for electrical networks is greatly improved with proper application of graph theory techniques. This paper investigates the application of Kruskal's maximal spanning tree algorithm in finding the optimal radial networks for different loading scenarios from an interconnected meshed electrical network integrated with distributed generation (DG). The work is done with an objective to assess the prowess of Kruskal's algorithm to compute, obtain or derive an optimal radial network (optimal maximal spanning tree) that gives improved voltage stability and highest loss minimization from among all the possible radial networks obtainable from the DG-integrated mesh network for different time-varying loading scenarios. The proposed technique has been demonstrated on a multiple test systems considering time-varying load levels to investigate the performance and effectiveness of the suggested method. For interconnected electrical networks with the presence of distributed generation, it was found that application of Kruskal's algorithm quickly computes optimal radial configurations that gives the least amount of power losses and better voltage stability even under varying load conditions. Article Highlights Investigated network reconfiguration strategies for electrical networks with the presence of Distributed Generation for time-varying loading conditions. Investigated the application of graph theory techniques in electrical networks for developing and planning reconfiguration strategies. Applied Kruskal’s maximal spanning tree algorithm to obtain the optimal radial electrical networks for different loading scenarios from DG-integrated meshed electrical network.


Author(s):  
Soochan Hwang ◽  
Sang-Young Cho ◽  
Taehyung Wang ◽  
Phillip C.-Y. Sheu

This paper describes a 3-D visualization method based on the concept of characteristic views (CVs). The idea of characteristic views was derived based on the observation that the infinite possible views of a 3-D object can be grouped into a finite number of equivalence classes so that within each class all the views are isomorphic in the sense that they have the same line-junction graphs. To visualize the changes of scenes in real time, the BSP tree algorithm is known to be efficient in a static environment in which the viewpoint can be changed easily. However, if a scene consists of many objects and each object consists of many polygons, the time complexity involved in traversing a BSP tree increases rapidly so that the original BSP tree algorithm may not be efficient. The method proposed in this paper is object-oriented in the sense that, for all viewpoints, at the preprocessing stage the ordering for displaying the objects is determined. At run time, the objects are displayed based on a pre-calculated ordering according to the viewpoint. In addition, a CV is used as a basic 2-D projected image of a 3-D object.


2019 ◽  
Vol 8 (3) ◽  
pp. 882-889
Author(s):  
Sharif Shah Newaj Bhuiyan ◽  
Othman O. Khalifa

In this paper, an algorithm is developed in 3D Stereo vision to improve image stabilization process for multi-camera viewpoints. Finding accurate unique matching key-points using Harris Laplace corner detection method for different photometric changes and geometric transformation in images. Then improved the connectivity of correct matching pairs by minimizing the global error using spanning tree algorithm. Tree algorithm helps to stabilize randomly positioned camera viewpoints in linear order. The unique matching key-points will be calculated only once with our method. Then calculated planar transformation will be applied for real time video rendering. The proposed algorithm can process more than 200 camera viewpoints within two seconds.


2013 ◽  
Vol 694-697 ◽  
pp. 2291-2294
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen

By using object oriented method design graph vertices into class, and in this foundation to increase visual member, realize from the source point to the other vertex of the shortest path algorithm of dynamic visualization. Around the two sync window animation, the left window with thick lines drawn through the vertices and edges, " revealed the source point to the other vertex of the shortest path " list box display shortest path sequence and path length, the right window demonstration algorithm dynamic implementation process, and in the " S " text box to display the current most find shortest path vertices. The system has friendly interface, visual image.


Sign in / Sign up

Export Citation Format

Share Document