Design and Realization of Algorithm Visualization Teaching Presentation System on Computer Graphics

2014 ◽  
Vol 687-691 ◽  
pp. 2768-2771
Author(s):  
Zu Wei Wang

Based on the study of abroad foundation on visual theory, we conduct depth discussion of the current introduction of visual teaching meaning. For the current computer graphics course content, we determine a visual teaching content and objectives, carry out the study and practice of computer graphics algorithm visualization teaching. This paper uses VB 6.0 visual programming tool to generate the basic primitives, polygon filling, cut a straight line segment, curve generation and visualization of fractal algorithm design and realization. Through analysis, this paper hold that use of visual teaching has a positive effect and influence for professors to change the way teachers help students understand computer graphics algorithm. In the process of teaching, students improve the understanding, exploration, discovery and creativity through observation, conjecture and verify.

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 56
Author(s):  
Gokarna Sharma ◽  
Ramachandran Vaidyanathan ◽  
Jerry L. Trahan

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We assume obstructed visibility where a robot cannot see another robot if a third robot is positioned between them on the straight line segment connecting them. In this paper, we consider the problem of positioning N autonomous robots on a plane so that every robot is visible to all others (this is called the Complete Visibility problem). This problem is fundamental, as it provides a basis to solve many other problems under obstructed visibility. In this paper, we provide the first, asymptotically optimal, O(1) time, O(1) color algorithm for Complete Visibility in the asynchronous setting. This significantly improves on an O(N)-time translation of the existing O(1) time, O(1) color semi-synchronous algorithm to the asynchronous setting. The proposed algorithm is collision-free, i.e., robots do not share positions, and their paths do not cross. We also introduce a new technique for moving robots in an asynchronous setting that may be of independent interest, called Beacon-Directed Curve Positioning.


2021 ◽  
Vol 8 (4) ◽  
pp. 13-23
Author(s):  
Sherzod Abdurahmanov

A brief historical excursion into the graphics of geometry of multidimensional spaces at the paper beginning clarifies the problem – the necessary to reduce the number of geometric actions performed when depicting multidimensional objects. The problem solution is based on the properties of geometric figures called N- simplexes, whose number of vertices is equal to N + 1, where N expresses their dimensionality. The barycenter (centroid) of the N-simplex is located at the point that divides the straight-line segment connecting the centroid of the (N–1)-simplex contained in it with the opposite vertex by 1: N. This property is preserved in the parallel projection (axonometry) of the simplex on the drawing plane, that allows the solution of the problem of determining the centroid of the simplex in its axonometry to be assigned to a mechanism which is a special Assembly of pantographs (the author's invention) with similarity coefficients 1:1, 1:2, 1:3, 1:4,...1:N. Next, it is established, that the spatial location of a point in N-dimensional space coincides with the centroid of the simplex, whose vertices are located on the point’s N-fold (barycentric) coordinates. In axonometry, the ends of both first pantograph’s links and the ends of only long links of the remaining ones are inserted into points indicating the projections of its barycentric coordinates and the mechanism node, which serves as a determinator, graphically marks the axonometric location of the point defined by its coordinates along the axes х1, х2, х3 … хN.. The translational movement of the support rods independently of each other can approximate or remote the barycentric coordinates of a point relative to the origin of coordinates, thereby assigning the corresponding axonometric places to the simplex barycenter, which changes its shape in accordance with its points’ occupied places in the coordinate axes. This is an axonograph of N-dimensional space, controlled by a numerical program. The last position indicates the possibility for using the equations of multidimensional spaces’ geometric objects given in the corresponding literature for automatic drawing when compiling such programs.


Author(s):  
A. A. Dubanov

This article discusses a kinematic model of the problem of group pursuit of a set of goals. The article discusses a variant of the model when all goals are achieved simultaneously. And also the possibility is considered when the achievement of goals occurs at the appointed time. In this model, the direction of the speeds by the pursuer can be arbitrary, in contrast to the method of parallel approach. In the method of parallel approach, the velocity vectors of the pursuer and the target are directed to a point on the Apollonius circle. The proposed pursuit model is based on the fact that the pursuer tries to follow the predicted trajectory of movement. The predicted trajectory of movement is built at each moment of time. This path is a compound curve that respects curvature constraints. A compound curve consists of a circular arc and a straight line segment. The pursuer's velocity vector applied to the point where the pursuer is located touches the given circle. The straight line segment passes through the target point and touches the specified circle. The radius of the circle in the model is taken equal to the minimum radius of curvature of the trajectory. The resulting compound line serves as an analogue of the line of sight in the parallel approach method. The iterative process of calculating the points of the pursuer’s trajectory is that the next point of position is the point of intersection of the circle centered at the current point of the pursuer’s position, with the line of sight corresponding to the point of the next position of the target. The radius of such a circle is equal to the product of the speed of the pursuer and the time interval corresponding to the time step of the iterative process. The time to reach the goal of each pursuer is a dependence on the speed of movement and the minimum radius of curvature of the trajectory. Multivariate analysis of the moduli of velocities and minimum radii of curvature of the trajectories of each of the pursuers for the simultaneous achievement of their goals i based on the methods of multidimensional descriptive geometry. To do this, the projection planes are entered on the Radishchev diagram: the radius of curvature of the trajectory and speed, the radius of curvature of the trajectory and the time to reach the goal. On the first plane, the projection builds a one-parameter set of level lines corresponding to the range of velocities. In the second graph, corresponding to a given range of speeds, functions of the dependence of the time to reach the target on the radius of curvature. The preset time for reaching the target and the preset value of the speed of the pursuer are the optimizing factors. This method of constructing the trajectories of pursuers to achieve a variety of goals at given time values may be in demand by the developers of autonomous unmanned aerial vehicles.


2015 ◽  
Vol 35 (6) ◽  
pp. 0615003
Author(s):  
李鑫 Li Xin ◽  
张跃强 Zhang Yueqiang ◽  
刘进博 Liu Jinbo ◽  
张小虎 Zhang Xiaohu ◽  
于起峰 Yu Qifeng

1976 ◽  
Vol 98 (1) ◽  
pp. 348-353 ◽  
Author(s):  
A. K. Abu-Akeel

A method is presented that leads to accurate estimation of the cumulative fatigue damage incurred in a randomly loaded structural element when loading is given in the form of spectral density load, or stress, plots. The load plots are here approximated by a series of straight lines and a closed formula is obtained to yield the damage incurred by the load within each straight line segment. The method avoids the errors that result from human misjudgment in the commonly used curve-stepping approach. It is also adaptable for computer applications and can be incorporated in a stress calculation program to save on computation time. In comparison to curve stepping, five straight-line segments may give the same accuracy as a hundred curve steps. This contrast, however, depends on the degree of irregularity of the load curve.


1975 ◽  
Vol 27 (3) ◽  
pp. 636-665 ◽  
Author(s):  
David Kelly ◽  
Ivan Rival

A finite partially ordered set (poset) P is customarily represented by drawing a small circle for each point, with a lower than b whenever a < b in P, and drawing a straight line segment from a to b whenever a is covered by b in P (see, for example, G. Birkhoff [2, p. 4]). A poset P is planar if such a diagram can be drawn for P in which none of the straight line segments intersect.


2014 ◽  
Vol 614 ◽  
pp. 676-680
Author(s):  
Zhe Wang ◽  
Qing Jin Ma ◽  
Cun Shen ◽  
Jing Fan ◽  
Chun Hua Jiang ◽  
...  

In this article, the author uses computer graphics visual programming method and visually expresses ionospheric characteristic parameters. Firstly, the significance of visualization of ionospheric characteristic parameters was described, then visualization process and methods were discussed, and finally the results of visualization of ionospheric parameters in typical conditions were given. The results show that visualization method of ionosphere characteristic parameters can directly reflect ionospheric electron density, electron temperature and other parameters, which is conductive to an intuitive understanding of various physical phenomena in ionosphere.


2014 ◽  
Vol 614 ◽  
pp. 576-579
Author(s):  
Xiu Hua Ma

In this paper, SolidWorks2012 was redeveloped by visual programming tool Visual Basic6.0 to realize the three-dimensional parametric design of wellhead gate valve and the transformation of corresponding engineering drawings on the engineering diagram template. Then the finite element analysis was progressed directly by using the SolidWorks module of the finite element analysis. This can shorten design time of gate valve and improve work efficiency.


Sign in / Sign up

Export Citation Format

Share Document