# Computer Simulation Algorithm of Team Gymnastics Formation Change Path under Artificial Intelligence and Network Big Data

Authors: Anfeng Zhu; Liangliang Cheng
Journal: Mobile Information Systems
 (2022)

---

## Abstract

With the development of economy, all world countries are entering the ranks of competitive sports. The Olympic Games or large-scale gymnastics performances are of great significance to the publicity and implementation of the national health plan. This paper aims to study the computer simulation algorithm of group gymnastics formation change path under artificial intelligence and network big data, so as to find out the path change algorithm of each team member, so that members in group gymnastics can clearly see their own moving route, and finally achieve the purpose of reducing the difficulty and cost of rehearsal. In this paper, the ellipse search algorithm and the traditionalDijkstra algorithm, the rectangle search algorithm, and the traditional Dijkstra algorithm are deeply compared and analyzed, and then, the experimental comparison between the ellipse search algorithm and the rectangle search algorithm is carried out. It is concluded that when finding the shortest path and when the straight-line distance between two nodes is 4.0 km, the time used by the rectangle search algorithm is 2.1 s, while the ellipse search algorithm needs 3.98 s. This shows that the rectangle search algorithm greatly saves the operation time and has superior performance.


---

## Body

## 1. Introduction

Group gymnastics is not only a large-scale celebration in life but also a wonderful content that cannot be ignored in the opening ceremony of the school sports meeting or in the Olympic Games of various countries. Chinese gymnastics has outstanding achievements in front of the people of the world and amazes people from all over the world. Behind a wonderful performance is the sweat of all the performers. Similarly, the successful interpretation of group gymnastics is inseparable from the efforts of performers, planners, organizational managers, scholars, and group gymnastics experts. It is precisely because China’s group gymnastics have achieved enviable results. This is not only an artistic interpretation but also an interpretation of a national spirit. Unity, wisdom, courage, and innovation are the spiritual support for the success of group gymnastics. With the progress of society and the prosperity of the economy, most people no longer worry about food and clothing, but have higher requirements for life. As countries around the world call on people to keep fit, people are aware of the importance of health. It is for this reason that the related research on enriching the theory of group gymnastics has also attracted people’s attention.Through relevant background investigations, the practice of group gymnastics has aroused good responses in various countries. But because of this, many scholars have ignored the theoretical research of group gymnastics. It is more about how group gymnastics can interpret better artistic effects, including background design, content presentation, and spiritual manifestation. However, no specific research has been made on any of these details. Therefore, the reader is more aware of related concepts and basic guidance, and cannot obtain detailed references. There are not many studies on the path algorithm of group gymnastics formation change. In this paper, under the environment of artificial intelligence and network big data, the computer simulation algorithm of group gymnastics formation transformation path is explored, so as to provide a better reference for the practice of group gymnastics.In recent years, the performance of group gymnastics has achieved good results. Therefore, scholars have not paid much attention to the theoretical research of group gymnastics, and it only talks about the advantages of artificial intelligence and big data-related technologies in group gymnastics from the side, but lacks specific conceptual research. Therefore, this paper explores the computer simulation algorithm of group gymnastics formation transformation path under artificial intelligence and network big data, so as to further promote the development of artificial intelligence and network big data and also provide reference for future theoretical research on group gymnastics.


## 2. Related Work

The Internet of Things has huge market potential, and the growth rate has been increasing in recent years. As one of the important technologies in recent years, the Internet of Things has attracted the attention of many scholars. The accumulation of massive data in cheminformatics databases makes the role of big data and artificial intelligence (AI) indispensable in drug design. In this era of big data, new algorithms and architectures need to be developed to mine these databases and meet the specific needs of various drug discovery processes, such as virtual drug screening and de novo molecular design. Tripathi et al. summarized the role of big data and artificial intelligence technologies currently being applied to meet the growing research needs in the drug discovery pipeline [1]. The combination of big data and artificial intelligence (AI) is increasingly impacting the field of electrophysiology, creating algorithms to improve automated diagnosis of clinical ECG or ambulatory heart rhythm devices. Leur et al. described the opportunities and threats of artificial intelligence in electrophysiology, focusing on the electrocardiogram. It further guides clinicians to evaluate new AI electrophysiological applications before clinical implementation [2]. Artificial intelligence has revolutionized the drug development process, enabling the rapid identification of potentially bioactive compounds from millions of drug candidates in a short period of time. Nayarisseri et al. provided a comprehensive overview of some applications of the tools of machine learning and concluded that in the era of big data, machine learning methods have developed into a powerful and effective method to deal with the large amount of data generated by modern drug discovery [3]. Recently, big data and artificial intelligence (AI) based on communication systems have become one of the hottest issues in the technology field, and methods to analyze big data using artificial intelligence methods are now considered essential. Jeong and Park involved topics in different research fields, provided different paradigms, and provided new ideas and directions for artificial intelligence research [4]. The implementation of artificial intelligence (AI) in a smart society, where analysis of human habits is mandatory, requires automated data scheduling and analysis using smart applications, smart infrastructure, smart systems, and smart networks. Against this backdrop of a large gap between training and operational processes, DR proposes near-zero fault advanced diagnostics (AD) for intelligent management to close this gap, demonstrating that it can be exploited in any context of society 5.0 to reduce risk factors at all management levels and ensure quality and sustainability [5]. In this digital age, humanity has greatly increased its reliance on technology in various fields. With the advancement of Internet technology, cybersecurity of software and hardware systems is now a prerequisite for major business operations. A deep learning method for detecting IOT network attacks using long-term and short-term network classifiers is introduced. Experimental tests show a precision of 99.09%, an F1 score of 99.46%, and a recall of 99.51%. The ability of this method to detect network attacks is excellent [6]. To sum up, artificial intelligence and network big data have been applied to various fields, including drug discovery and IOT security. With the development of big data and artificial intelligence technology, group gymnastics has not received more attention. Therefore, how to make better use of science and technology to promote the development of group gymnastics is what many scholars need to pay attention to at present, and more explorations need to be carried out in depth.


## 3. Relevant Research Theory of Computer Simulation Algorithm for Group Gymnastics Formation Transformation Path under Artificial Intelligence and Network Big Data

### 3.1. The Relationship between Artificial Intelligence and Network Big Data

With the advent of the information age, intelligence and informatization have become an inseparable part of people’s lives. In recent years, big data, artificial intelligence, and the Internet of Things have entered daily life with the era of the Internet, including smart furniture, smart buildings, robots, and smart toys. Intelligence and informatization complement each other. With the advent of the age of intelligence, complex and meaningless human labor will be replaced by machines, and human beings will further develop to a higher level. In the era of big data, intelligence is a significant feature of informatization [7]. Humanity will also enter the era of intelligence. Artificial intelligence and big data have brought convenience to people’s lives and brought high efficiency to people’s work, but also quickly joined the competition of group gymnastics formations. Using intelligent technology is to provide new methods and tools for group gymnastics formation change path, drive the implementation of more efficient computer simulation algorithms, and promote the high-level and precise transformation of group gymnastics [8].With the rapid development and progress of science and technology, Internet informatization plays an increasingly significant role in human social life, and Internet technology has penetrated into all walks of life, promoting the arrival of the era of big data. In the era of big data, data have become the core element of the network. The Internet of Things and artificial intelligence technology are two crucial modern technologies in the era of big data, which make people’ s production and life more convenient, efficient, and intelligent. When the world enters the era of big data, society will experience similar crustal movements. Indeed, the era of big data has completed a series of data-centered technological changes in concepts, technologies, and applications. Such extensive and fundamental changes will inevitably lead to changes in human production and communication methods, and changes in social management methods and structures, and will also call for the corresponding reform of the computer simulation algorithm of group gymnastics formation transformation path [9, 10].The data used by the Internet of Things generate big data through automatic perception and collection, which cannot be analyzed and processed manually by traditional data analysis methods. The way to make IOT data analysis and processing more intelligent is to apply artificial intelligence to it [11, 12]. Artificial intelligence equipment and products will be more and more developed and applied. The addition of the Internet of Things technology solves the problems of data transmission, data collection, data processing, and information transmission and forms a good chain reaction between information input, conversion, and transmission, which provides good automation and intelligence, foundation, and support.


### 3.2. Team Gymnastics

Group gymnastics, as the name suggests, is a collective performance project and a sports performance art. Group gymnastics is performed on the playground by dozens, hundreds, or even thousands of performers. Group gymnastics is not an individual performance, and a successful individual performance cannot make a collective performance. Therefore, the main requirements of group gymnastics are to obey the unified command and to have consistent movements. Everyone in the group is an individual with strong executive power. For the individual, the movement and the path of travel are not difficult, but the group gymnastics is based on the whole, and it is necessary to interpret the overall presentation effect and show it to the audience. All individuals are required to coordinate their movements to reach a designated location within a specific time [13].Group gymnastics not only expresses an artistic effect but also expresses the central idea. The formation needs to be in accordance with the requirements of the exercise so that the performers can perform their movements on the stage with agility and regularity. The shocking effect of group gymnastics is achieved through the presentation of various patterns and formations. The practice of group gymnastics needs to cultivate group awareness and group cooperation. This is not just an artistic presentation, but a collective spirit. One of the basic elements of group gymnastics is formation. Exploring the transformation of the formation path is to allow the performers to practice more efficiently and present a more exciting performance. The visual effect of group gymnastics is inspiring, so the spread of civilized culture can be achieved through group gymnastics, which will have a good effect [14, 15].


### 3.3. Application of Computer Technology in Group Gymnastics Formation

The era of the Internet will rapidly enter human civilization with the birth of the computer, and the way of life of human beings has undergone tremendous changes. People are no longer purely handmade everyday objects, nor are they limited to cash transactions. Both the way of production and the way of consumption have undergone earth-shaking changes. In recent years, computer technology has been applied to natural and social sciences, and as a trend calling for sports culture, it is imperative to accept the baptism of the information age as group operation as a sports art [16].The computer-aided group gymnastics technology started from scratch, and there are three most important application elements in its development process, namely, people, system, and technology. If the development process of computer-aided group gymnastics is regarded as a technical application, then in this application, people are the foundation, the system is the premise, and the technology is the guarantee. It is the human element that combines group gymnastics with computer technology, and technologies such as computer simulation algorithms appear. At the same time, it is also the person who uses the computer simulation algorithm in practice, sums up experience, and keeps innovating, so that the computer simulation technology can continue to develop [17].In recent years, the development of high and new technology in the application field and the wide application of computer technology have opened up a wider space for the study of group gymnastics, for example, developing software for group exercise path design and arranging formations through coordinate points. The application of computer technology in the group gymnastics formation change path algorithm can strengthen the connection between people and paths. It is an efficient group gym formation change path algorithm simulation system [18, 19].


### 3.4. Related Algorithms of the Shortest Path

In the computer simulation algorithm, the most critical part is choosing the most appropriate path planning for group gymnastics, and the performance path of each performer is calculated by the shortest path algorithm. The algorithm is also widely used in various industries, such as logistics transportation, intelligent transportation, and emergency first aid. In the actual gymnastics formation transformation path, theDijkstra algorithm is often used to solve the shortest path between two points [20, 21].The traditionalDijkstra algorithm generates the shortest path according to the increasing order of the path length, and it is used to calculate the shortest path from an initial point to other nodes. In actual group gymnastics formation transformation path calculation, Dijkstra algorithm is often used to solve the shortest path between two points. When the algorithm is executed, the nodes in the network are divided into three types: unmarked nodes, temporary marked nodes, and marked nodes. When initializing the algorithm, the nodes in the network are initialized as unmarked nodes, and the temporary nodes are defined as the nodes connected to the shortest path nodes during the search process. Every time the algorithm loops, it is necessary to find the shortest path corresponding to the temporary node set, which changes from a temporary node to a marked node. When all nodes are marked nodes, the algorithm ends.Storage structure optimizationDijkstra algorithm adopts the storage structure of the adjacency list. The adjacency list establishes an array avv=0,1,2,…n for each node in Figure 1 to store the information of the edge connected to the node; that is, each element in the array represents the edge starting from the node v. Using adjacency list storage can save a lot of storage space. Therefore, aiming at the problem of large data redundancy, this paper adopts the adjacency list data structure to store the formation transformation path of group gymnastics to reduce the space complexity of the algorithm [22].Figure 1
Adjacency list.The traditionalDijkstra algorithm is a common shortest path algorithm. However, in order to overcome the problems of many search nodes, wide range, and long-time consumption, this paper introduces the rectangle search algorithm and the ellipse search algorithm, and analyzes the two algorithms. The article combines the big data and artificial intelligence to give the search range and area formulas of the two algorithms, and finally conducts experimental comparison and analysis.


#### 3.4.1. Ellipse Search Algorithm

The ellipse search algorithm is an algorithm based on the traditionalDijkstra algorithm. The difference is that because the algorithm searches based on ellipses. Compared with the traditional Dijkstra algorithm, the ellipse search algorithm has fewer search nodes. The traditional Dijkstra algorithm is to find the shortest path through a circular search range, as shown in Figure 2. The search area in the traditional Dijkstra algorithm is a circle. Although the search results of the circular search method are more accurate, the search area is too wide and the algorithm complexity is high, which affects the real-time performance of the experiment [23].Figure 2
TraditionalDijkstra algorithm.In order to solve the shortcomings of the traditionalDijkstra algorithm, the ellipse search algorithm sets a feature attribute for each node in the traditional Dijkstra algorithm, which is used as the basis for being selected as a marker node, which increases the directionality of the Dijkstra algorithm, as shown in Figure 3, reducing the number of search nodes to improve the efficiency of the algorithm.Figure 3
Dijkstra algorithm for ellipse restricted search area.The search range of the ellipse search algorithm is shown in Figure4, and its boundary satisfies the ellipse trajectory of formula (1), and the shortest path can be found between the nodes inside the ellipse. The calculation process of its elliptical trajectory is shown in following formulas:(1)ovi+vid=2a,where o indicates the starting node, d indicates the termination node, and ovi indicates the distance from the starting point o to any node vi.where r0 represents a parameter of the set T and Dod represents the straight-line distance from node o to node d.Figure 4
Schematic diagram of ellipse search range.(2)2a=r0od,(3)A=O×Do,do∈Od∈D,(4)r=PodDod=Pod1+Pod2+⋯Pod|kkD|1,(5)r=1k1cosθ1+1cosθ2+⋯+1cosθk,(6)r=1k∑1k1cosθi.Among them, the calculation process ofr is shown in Figure 5. Where k indicates the equal portion into which the Dod is divided.Figure 5
Schematic diagram ofr value.(7)rmax=1k∑1k1cosθi=2,(8)μ=E1cosθ≈1.122,(9)σ2=D1cosθ≈0.01412.


#### 3.4.2. Rectangle Search Algorithm

The ellipse search algorithm calculates the nodes in the ellipse. While reducing the number of search nodes, it takes too much time to determine whether the nodes are in the ellipse. The rectangle search algorithm reduces the amount of computation by calculating the enclosing rectangle of the ellipse and using the enclosing rectangle as the search area [24–26]. Its search range is shown in Figure 6.Figure 6
Schematic diagram of rectangular search range.As shown in Figure6, the method is to find the circumscribed rectangle that is tangent to the ellipse, for example, ABCD or A1B1C1D1 in Figure 6, which is usually divided into a circumscribed rectangle based on a standard ellipse and a circumscribed rectangle based on a general ellipse.The circumscribed rectangle based on the standard ellipse is the search range area to find the rectangle with the center of the ellipse as the origin. As shown in Figure7, its satisfying conditions are shown in following formulas:Figure 7
The maximum value map of rectangular search area.(10)xo=xd=c,(11)rod=2a.Changing the ellipse in the special case is to get the ellipse in the general case, as shown in Figure8. Its calculation formula is shown in following formulas:where θ represents the rotation angle based on the standard ellipse, xc represents the distance that the standard ellipse is translated on the axis, and yc indicates the distance that the standard ellipse is translated on the y axis.Figure 8
Schematic diagram of rectangular search range based on general ellipse.(12)x−xccosθ+y−ycsinθ2a2+−x−xcsinθ+y−yccosθ2b2=1,(13)c2+b2=a2,(14)xc=xo+xd2,(15)yc=yo+yd2,(16)θ=arctanyo−ydxo−xd,(17)xm=xc±a2cos2θ+b2sin2θ,(18)ym=yc±b2cos2θ+a2sin2θ,Then, the simplified formula forxm,ym is obtained as follows:(19)xm=xc±odr2−sin2θ,(20)ym=yc±odr2−cos2θ,where xm is the maximum and minimum values of the abscissa of the rectangle border, ym is the maximum and minimum values of the vertical coordinates of the rectangle border, and od indicates the distance between the start node o and the end node d.


## 3.1. The Relationship between Artificial Intelligence and Network Big Data

With the advent of the information age, intelligence and informatization have become an inseparable part of people’s lives. In recent years, big data, artificial intelligence, and the Internet of Things have entered daily life with the era of the Internet, including smart furniture, smart buildings, robots, and smart toys. Intelligence and informatization complement each other. With the advent of the age of intelligence, complex and meaningless human labor will be replaced by machines, and human beings will further develop to a higher level. In the era of big data, intelligence is a significant feature of informatization [7]. Humanity will also enter the era of intelligence. Artificial intelligence and big data have brought convenience to people’s lives and brought high efficiency to people’s work, but also quickly joined the competition of group gymnastics formations. Using intelligent technology is to provide new methods and tools for group gymnastics formation change path, drive the implementation of more efficient computer simulation algorithms, and promote the high-level and precise transformation of group gymnastics [8].With the rapid development and progress of science and technology, Internet informatization plays an increasingly significant role in human social life, and Internet technology has penetrated into all walks of life, promoting the arrival of the era of big data. In the era of big data, data have become the core element of the network. The Internet of Things and artificial intelligence technology are two crucial modern technologies in the era of big data, which make people’ s production and life more convenient, efficient, and intelligent. When the world enters the era of big data, society will experience similar crustal movements. Indeed, the era of big data has completed a series of data-centered technological changes in concepts, technologies, and applications. Such extensive and fundamental changes will inevitably lead to changes in human production and communication methods, and changes in social management methods and structures, and will also call for the corresponding reform of the computer simulation algorithm of group gymnastics formation transformation path [9, 10].The data used by the Internet of Things generate big data through automatic perception and collection, which cannot be analyzed and processed manually by traditional data analysis methods. The way to make IOT data analysis and processing more intelligent is to apply artificial intelligence to it [11, 12]. Artificial intelligence equipment and products will be more and more developed and applied. The addition of the Internet of Things technology solves the problems of data transmission, data collection, data processing, and information transmission and forms a good chain reaction between information input, conversion, and transmission, which provides good automation and intelligence, foundation, and support.


## 3.2. Team Gymnastics

Group gymnastics, as the name suggests, is a collective performance project and a sports performance art. Group gymnastics is performed on the playground by dozens, hundreds, or even thousands of performers. Group gymnastics is not an individual performance, and a successful individual performance cannot make a collective performance. Therefore, the main requirements of group gymnastics are to obey the unified command and to have consistent movements. Everyone in the group is an individual with strong executive power. For the individual, the movement and the path of travel are not difficult, but the group gymnastics is based on the whole, and it is necessary to interpret the overall presentation effect and show it to the audience. All individuals are required to coordinate their movements to reach a designated location within a specific time [13].Group gymnastics not only expresses an artistic effect but also expresses the central idea. The formation needs to be in accordance with the requirements of the exercise so that the performers can perform their movements on the stage with agility and regularity. The shocking effect of group gymnastics is achieved through the presentation of various patterns and formations. The practice of group gymnastics needs to cultivate group awareness and group cooperation. This is not just an artistic presentation, but a collective spirit. One of the basic elements of group gymnastics is formation. Exploring the transformation of the formation path is to allow the performers to practice more efficiently and present a more exciting performance. The visual effect of group gymnastics is inspiring, so the spread of civilized culture can be achieved through group gymnastics, which will have a good effect [14, 15].


## 3.3. Application of Computer Technology in Group Gymnastics Formation

The era of the Internet will rapidly enter human civilization with the birth of the computer, and the way of life of human beings has undergone tremendous changes. People are no longer purely handmade everyday objects, nor are they limited to cash transactions. Both the way of production and the way of consumption have undergone earth-shaking changes. In recent years, computer technology has been applied to natural and social sciences, and as a trend calling for sports culture, it is imperative to accept the baptism of the information age as group operation as a sports art [16].The computer-aided group gymnastics technology started from scratch, and there are three most important application elements in its development process, namely, people, system, and technology. If the development process of computer-aided group gymnastics is regarded as a technical application, then in this application, people are the foundation, the system is the premise, and the technology is the guarantee. It is the human element that combines group gymnastics with computer technology, and technologies such as computer simulation algorithms appear. At the same time, it is also the person who uses the computer simulation algorithm in practice, sums up experience, and keeps innovating, so that the computer simulation technology can continue to develop [17].In recent years, the development of high and new technology in the application field and the wide application of computer technology have opened up a wider space for the study of group gymnastics, for example, developing software for group exercise path design and arranging formations through coordinate points. The application of computer technology in the group gymnastics formation change path algorithm can strengthen the connection between people and paths. It is an efficient group gym formation change path algorithm simulation system [18, 19].


## 3.4. Related Algorithms of the Shortest Path

In the computer simulation algorithm, the most critical part is choosing the most appropriate path planning for group gymnastics, and the performance path of each performer is calculated by the shortest path algorithm. The algorithm is also widely used in various industries, such as logistics transportation, intelligent transportation, and emergency first aid. In the actual gymnastics formation transformation path, theDijkstra algorithm is often used to solve the shortest path between two points [20, 21].The traditionalDijkstra algorithm generates the shortest path according to the increasing order of the path length, and it is used to calculate the shortest path from an initial point to other nodes. In actual group gymnastics formation transformation path calculation, Dijkstra algorithm is often used to solve the shortest path between two points. When the algorithm is executed, the nodes in the network are divided into three types: unmarked nodes, temporary marked nodes, and marked nodes. When initializing the algorithm, the nodes in the network are initialized as unmarked nodes, and the temporary nodes are defined as the nodes connected to the shortest path nodes during the search process. Every time the algorithm loops, it is necessary to find the shortest path corresponding to the temporary node set, which changes from a temporary node to a marked node. When all nodes are marked nodes, the algorithm ends.Storage structure optimizationDijkstra algorithm adopts the storage structure of the adjacency list. The adjacency list establishes an array avv=0,1,2,…n for each node in Figure 1 to store the information of the edge connected to the node; that is, each element in the array represents the edge starting from the node v. Using adjacency list storage can save a lot of storage space. Therefore, aiming at the problem of large data redundancy, this paper adopts the adjacency list data structure to store the formation transformation path of group gymnastics to reduce the space complexity of the algorithm [22].Figure 1
Adjacency list.The traditionalDijkstra algorithm is a common shortest path algorithm. However, in order to overcome the problems of many search nodes, wide range, and long-time consumption, this paper introduces the rectangle search algorithm and the ellipse search algorithm, and analyzes the two algorithms. The article combines the big data and artificial intelligence to give the search range and area formulas of the two algorithms, and finally conducts experimental comparison and analysis.


### 3.4.1. Ellipse Search Algorithm

The ellipse search algorithm is an algorithm based on the traditionalDijkstra algorithm. The difference is that because the algorithm searches based on ellipses. Compared with the traditional Dijkstra algorithm, the ellipse search algorithm has fewer search nodes. The traditional Dijkstra algorithm is to find the shortest path through a circular search range, as shown in Figure 2. The search area in the traditional Dijkstra algorithm is a circle. Although the search results of the circular search method are more accurate, the search area is too wide and the algorithm complexity is high, which affects the real-time performance of the experiment [23].Figure 2
TraditionalDijkstra algorithm.In order to solve the shortcomings of the traditionalDijkstra algorithm, the ellipse search algorithm sets a feature attribute for each node in the traditional Dijkstra algorithm, which is used as the basis for being selected as a marker node, which increases the directionality of the Dijkstra algorithm, as shown in Figure 3, reducing the number of search nodes to improve the efficiency of the algorithm.Figure 3
Dijkstra algorithm for ellipse restricted search area.The search range of the ellipse search algorithm is shown in Figure4, and its boundary satisfies the ellipse trajectory of formula (1), and the shortest path can be found between the nodes inside the ellipse. The calculation process of its elliptical trajectory is shown in following formulas:(1)ovi+vid=2a,where o indicates the starting node, d indicates the termination node, and ovi indicates the distance from the starting point o to any node vi.where r0 represents a parameter of the set T and Dod represents the straight-line distance from node o to node d.Figure 4
Schematic diagram of ellipse search range.(2)2a=r0od,(3)A=O×Do,do∈Od∈D,(4)r=PodDod=Pod1+Pod2+⋯Pod|kkD|1,(5)r=1k1cosθ1+1cosθ2+⋯+1cosθk,(6)r=1k∑1k1cosθi.Among them, the calculation process ofr is shown in Figure 5. Where k indicates the equal portion into which the Dod is divided.Figure 5
Schematic diagram ofr value.(7)rmax=1k∑1k1cosθi=2,(8)μ=E1cosθ≈1.122,(9)σ2=D1cosθ≈0.01412.


### 3.4.2. Rectangle Search Algorithm

The ellipse search algorithm calculates the nodes in the ellipse. While reducing the number of search nodes, it takes too much time to determine whether the nodes are in the ellipse. The rectangle search algorithm reduces the amount of computation by calculating the enclosing rectangle of the ellipse and using the enclosing rectangle as the search area [24–26]. Its search range is shown in Figure 6.Figure 6
Schematic diagram of rectangular search range.As shown in Figure6, the method is to find the circumscribed rectangle that is tangent to the ellipse, for example, ABCD or A1B1C1D1 in Figure 6, which is usually divided into a circumscribed rectangle based on a standard ellipse and a circumscribed rectangle based on a general ellipse.The circumscribed rectangle based on the standard ellipse is the search range area to find the rectangle with the center of the ellipse as the origin. As shown in Figure7, its satisfying conditions are shown in following formulas:Figure 7
The maximum value map of rectangular search area.(10)xo=xd=c,(11)rod=2a.Changing the ellipse in the special case is to get the ellipse in the general case, as shown in Figure8. Its calculation formula is shown in following formulas:where θ represents the rotation angle based on the standard ellipse, xc represents the distance that the standard ellipse is translated on the axis, and yc indicates the distance that the standard ellipse is translated on the y axis.Figure 8
Schematic diagram of rectangular search range based on general ellipse.(12)x−xccosθ+y−ycsinθ2a2+−x−xcsinθ+y−yccosθ2b2=1,(13)c2+b2=a2,(14)xc=xo+xd2,(15)yc=yo+yd2,(16)θ=arctanyo−ydxo−xd,(17)xm=xc±a2cos2θ+b2sin2θ,(18)ym=yc±b2cos2θ+a2sin2θ,Then, the simplified formula forxm,ym is obtained as follows:(19)xm=xc±odr2−sin2θ,(20)ym=yc±odr2−cos2θ,where xm is the maximum and minimum values of the abscissa of the rectangle border, ym is the maximum and minimum values of the vertical coordinates of the rectangle border, and od indicates the distance between the start node o and the end node d.


## 3.4.1. Ellipse Search Algorithm

The ellipse search algorithm is an algorithm based on the traditionalDijkstra algorithm. The difference is that because the algorithm searches based on ellipses. Compared with the traditional Dijkstra algorithm, the ellipse search algorithm has fewer search nodes. The traditional Dijkstra algorithm is to find the shortest path through a circular search range, as shown in Figure 2. The search area in the traditional Dijkstra algorithm is a circle. Although the search results of the circular search method are more accurate, the search area is too wide and the algorithm complexity is high, which affects the real-time performance of the experiment [23].Figure 2
TraditionalDijkstra algorithm.In order to solve the shortcomings of the traditionalDijkstra algorithm, the ellipse search algorithm sets a feature attribute for each node in the traditional Dijkstra algorithm, which is used as the basis for being selected as a marker node, which increases the directionality of the Dijkstra algorithm, as shown in Figure 3, reducing the number of search nodes to improve the efficiency of the algorithm.Figure 3
Dijkstra algorithm for ellipse restricted search area.The search range of the ellipse search algorithm is shown in Figure4, and its boundary satisfies the ellipse trajectory of formula (1), and the shortest path can be found between the nodes inside the ellipse. The calculation process of its elliptical trajectory is shown in following formulas:(1)ovi+vid=2a,where o indicates the starting node, d indicates the termination node, and ovi indicates the distance from the starting point o to any node vi.where r0 represents a parameter of the set T and Dod represents the straight-line distance from node o to node d.Figure 4
Schematic diagram of ellipse search range.(2)2a=r0od,(3)A=O×Do,do∈Od∈D,(4)r=PodDod=Pod1+Pod2+⋯Pod|kkD|1,(5)r=1k1cosθ1+1cosθ2+⋯+1cosθk,(6)r=1k∑1k1cosθi.Among them, the calculation process ofr is shown in Figure 5. Where k indicates the equal portion into which the Dod is divided.Figure 5
Schematic diagram ofr value.(7)rmax=1k∑1k1cosθi=2,(8)μ=E1cosθ≈1.122,(9)σ2=D1cosθ≈0.01412.


## 3.4.2. Rectangle Search Algorithm

The ellipse search algorithm calculates the nodes in the ellipse. While reducing the number of search nodes, it takes too much time to determine whether the nodes are in the ellipse. The rectangle search algorithm reduces the amount of computation by calculating the enclosing rectangle of the ellipse and using the enclosing rectangle as the search area [24–26]. Its search range is shown in Figure 6.Figure 6
Schematic diagram of rectangular search range.As shown in Figure6, the method is to find the circumscribed rectangle that is tangent to the ellipse, for example, ABCD or A1B1C1D1 in Figure 6, which is usually divided into a circumscribed rectangle based on a standard ellipse and a circumscribed rectangle based on a general ellipse.The circumscribed rectangle based on the standard ellipse is the search range area to find the rectangle with the center of the ellipse as the origin. As shown in Figure7, its satisfying conditions are shown in following formulas:Figure 7
The maximum value map of rectangular search area.(10)xo=xd=c,(11)rod=2a.Changing the ellipse in the special case is to get the ellipse in the general case, as shown in Figure8. Its calculation formula is shown in following formulas:where θ represents the rotation angle based on the standard ellipse, xc represents the distance that the standard ellipse is translated on the axis, and yc indicates the distance that the standard ellipse is translated on the y axis.Figure 8
Schematic diagram of rectangular search range based on general ellipse.(12)x−xccosθ+y−ycsinθ2a2+−x−xcsinθ+y−yccosθ2b2=1,(13)c2+b2=a2,(14)xc=xo+xd2,(15)yc=yo+yd2,(16)θ=arctanyo−ydxo−xd,(17)xm=xc±a2cos2θ+b2sin2θ,(18)ym=yc±b2cos2θ+a2sin2θ,Then, the simplified formula forxm,ym is obtained as follows:(19)xm=xc±odr2−sin2θ,(20)ym=yc±odr2−cos2θ,where xm is the maximum and minimum values of the abscissa of the rectangle border, ym is the maximum and minimum values of the vertical coordinates of the rectangle border, and od indicates the distance between the start node o and the end node d.


## 4. Algorithm Experiment Comparative Analysis

### 4.1. Experimental Comparative Analysis of Improved Ellipse Algorithm and TraditionalDijkstra Algorithm

This paper conducts a comparative experiment between the improved ellipse algorithm and the traditionalDijkstra algorithm through environmental testing [27, 28]. The first is the time used to search the area. The traditional Dijkstra algorithm search area formula is shown in formula (21). The formula for the search area of the improved ellipse algorithm is shown in formula (22). The second is the time spent searching for a path. The experimental data are selected from the real data of the team gym formation path of A.(21)SDijistra=πr2=πr+12od2,(22)Sellipse=πab=πrod2r2−1od2.


#### 4.1.1. Area Comparison

When the ratio of the search area between the improved ellipse algorithm and the traditionalDijkstra algorithm reaches the maximum value, the situation that the shortest path cannot be found due to the small search range can be avoided. As shown in Table 1, when r is the maximum value, the ratio of the search area of the two algorithms is the largest, which not only improves the reliability of the algorithm, but also improves the efficiency of the algorithm.Table 1
The ratio of the search area of the two algorithms.
The value of the coefficientrThe area ratio of the improved ellipse algorithm and the traditional algorithm1.150.1421.200.1681.250.1851.300.2051.350.2221.400.239As can be seen from Figure9, compared with the traditional Dijkstra algorithm, the improved ellipse algorithm has a significantly smaller search area than the traditional Dijkstra algorithm. When the distance between the two nodes of the shortest path is 6, the search area of the improved ellipse algorithm is 42 km ∗ km, while the traditional Dijkstra algorithm reaches 165 km ∗ km. When the search area is smaller, the number of search nodes is smaller, which shows that the improved ellipse algorithm can reduce the number of search nodes and reduce the complexity of the algorithm.Figure 9
Comparison of the search area of the two algorithms. (a) Graph of search area data of improved ellipse algorithm. (b) TraditionalDijkstra algorithm search area data plot.
(a)(b)


#### 4.1.2. Search Path Time Comparison

It is not difficult to see from Figure10 that compared with the traditional Dijkstra algorithm, the ellipse improved algorithm takes less time to search for a path. When the distance between the two nodes of the shortest path is 6 km, the improved ellipse algorithm takes 3.5 s, and the traditional Dijkstra algorithm takes 6.5 s. This shows that the execution efficiency of the improved ellipse algorithm is high.Figure 10
Comparison of the time used by the two algorithms. (a) Time data graph of the improved ellipse algorithm. (b) Time data plot of the traditionalDijkstra algorithm.
(a)(b)


### 4.2. Experimental Comparative Analysis of Rectangle Search Algorithm and TraditionalDijkstra Algorithm

The experimental data are selected from the real data of the team gym formation path of A. There are two indicators for evaluating the algorithm: the first is the number of nodes searched, and the second is the time spent searching the path.


#### 4.2.1. Comparison of the Number of Nodes

As shown in Figure11, when traversing, the number of nodes in the rectangle search algorithm is much less than that of the traditional Dijkstra algorithm. When the straight line distance of the shortest path point pair to be found is the same, the rectangle search algorithm has a maximum of 451 nodes, while the traditional Dijkstra algorithm reaches 763 nodes. This shows that the efficiency of the rectangle search algorithm is better.Figure 11
Comparison of the time used by the two algorithms. (a) The number of nodes traversed data graph of the rectangle search algorithm. (b) TraditionalDijkstra algorithm node count traversal data graph.
(a)(b)


#### 4.2.2. Comparison of Time Consumed When Searching for a Path

As shown in Figure12, as the straight-line distance between two nodes increases, the time consumed by the rectangle search algorithm to find the shortest path is much less than that of the Dijkstra algorithm.Figure 12
Time comparison of the two algorithms. (a) Graph of the time consumed by the rectangle search algorithm to search for a path. (b) A graph of the time spent in traditionalDijkstra searching for a path.
(a)(b)


### 4.3. Comparative Analysis of Ellipse Search Algorithm and Rectangle Search Algorithm

This paper compares the ellipse search algorithm with the rectangle search algorithm to find the optimal algorithm. The article will be evaluated from two aspects: the first is the search area and the second is the time consumed by the path search. Its area formula is shown in following formulas:(23)SR=4ab=4rr2−1od2,(24)SR=2a2+b2=22r2−1od2.


#### 4.3.1. Comparison of Search Area

When the ratio of the search areas of the two algorithms reaches the minimum value, the number of nodes can be reduced while ensuring that the maximum area is within a reasonable range, as shown in following formulas:(25)SRmaxSellipse=2a2+b2πab=4r2−2πrr2−1,(26)SRminSellipse=4abπab≈1.27.As shown in Table2, when r=2, the ratio of the search area of the ellipse search algorithm to the rectangle search algorithm is the smallest and compared with the search area of the Dijkstra algorithm, the search area of the rectangle search algorithm is slightly larger than that of the ellipse search algorithm, but not much. But the rectangle search algorithm is more likely to find the shortest path than the ellipse search algorithm.Table 2
The ratio of the search area of the two algorithms.
The value of the coefficientrRectangle algorithm and ellipse algorithm search area ratio1.151.601.201.511.251.431.301.411.351.3751.401.36


#### 4.3.2. Comparison of Search Time

It is not difficult to see from Table3 that when the distance between the two nodes of the shortest path to be found increases, the time used by the rectangle search algorithm is much lower than that of the ellipse search algorithm, and when the straight-line distance between two nodes is 1.5, the ellipse search algorithm takes 1.45 s, whereas the rectangle search algorithm takes only 0.3 s, which shows that the algorithm greatly saves the time used.Table 3
Time comparison of the two algorithms.
Algorithm search time (s)The straight-line distance of the shortest path point pair to be found (km)Ellipse search algorithmRectangle search algorithm0.50.201.00.350.11.51.450.32.01.731.32.51.981.453.02.11.763.53.21.894.03.982.1


## 4.1. Experimental Comparative Analysis of Improved Ellipse Algorithm and TraditionalDijkstra Algorithm

This paper conducts a comparative experiment between the improved ellipse algorithm and the traditionalDijkstra algorithm through environmental testing [27, 28]. The first is the time used to search the area. The traditional Dijkstra algorithm search area formula is shown in formula (21). The formula for the search area of the improved ellipse algorithm is shown in formula (22). The second is the time spent searching for a path. The experimental data are selected from the real data of the team gym formation path of A.(21)SDijistra=πr2=πr+12od2,(22)Sellipse=πab=πrod2r2−1od2.


### 4.1.1. Area Comparison

When the ratio of the search area between the improved ellipse algorithm and the traditionalDijkstra algorithm reaches the maximum value, the situation that the shortest path cannot be found due to the small search range can be avoided. As shown in Table 1, when r is the maximum value, the ratio of the search area of the two algorithms is the largest, which not only improves the reliability of the algorithm, but also improves the efficiency of the algorithm.Table 1
The ratio of the search area of the two algorithms.
The value of the coefficientrThe area ratio of the improved ellipse algorithm and the traditional algorithm1.150.1421.200.1681.250.1851.300.2051.350.2221.400.239As can be seen from Figure9, compared with the traditional Dijkstra algorithm, the improved ellipse algorithm has a significantly smaller search area than the traditional Dijkstra algorithm. When the distance between the two nodes of the shortest path is 6, the search area of the improved ellipse algorithm is 42 km ∗ km, while the traditional Dijkstra algorithm reaches 165 km ∗ km. When the search area is smaller, the number of search nodes is smaller, which shows that the improved ellipse algorithm can reduce the number of search nodes and reduce the complexity of the algorithm.Figure 9
Comparison of the search area of the two algorithms. (a) Graph of search area data of improved ellipse algorithm. (b) TraditionalDijkstra algorithm search area data plot.
(a)(b)


### 4.1.2. Search Path Time Comparison

It is not difficult to see from Figure10 that compared with the traditional Dijkstra algorithm, the ellipse improved algorithm takes less time to search for a path. When the distance between the two nodes of the shortest path is 6 km, the improved ellipse algorithm takes 3.5 s, and the traditional Dijkstra algorithm takes 6.5 s. This shows that the execution efficiency of the improved ellipse algorithm is high.Figure 10
Comparison of the time used by the two algorithms. (a) Time data graph of the improved ellipse algorithm. (b) Time data plot of the traditionalDijkstra algorithm.
(a)(b)


## 4.1.1. Area Comparison

When the ratio of the search area between the improved ellipse algorithm and the traditionalDijkstra algorithm reaches the maximum value, the situation that the shortest path cannot be found due to the small search range can be avoided. As shown in Table 1, when r is the maximum value, the ratio of the search area of the two algorithms is the largest, which not only improves the reliability of the algorithm, but also improves the efficiency of the algorithm.Table 1
The ratio of the search area of the two algorithms.
The value of the coefficientrThe area ratio of the improved ellipse algorithm and the traditional algorithm1.150.1421.200.1681.250.1851.300.2051.350.2221.400.239As can be seen from Figure9, compared with the traditional Dijkstra algorithm, the improved ellipse algorithm has a significantly smaller search area than the traditional Dijkstra algorithm. When the distance between the two nodes of the shortest path is 6, the search area of the improved ellipse algorithm is 42 km ∗ km, while the traditional Dijkstra algorithm reaches 165 km ∗ km. When the search area is smaller, the number of search nodes is smaller, which shows that the improved ellipse algorithm can reduce the number of search nodes and reduce the complexity of the algorithm.Figure 9
Comparison of the search area of the two algorithms. (a) Graph of search area data of improved ellipse algorithm. (b) TraditionalDijkstra algorithm search area data plot.
(a)(b)


## 4.1.2. Search Path Time Comparison

It is not difficult to see from Figure10 that compared with the traditional Dijkstra algorithm, the ellipse improved algorithm takes less time to search for a path. When the distance between the two nodes of the shortest path is 6 km, the improved ellipse algorithm takes 3.5 s, and the traditional Dijkstra algorithm takes 6.5 s. This shows that the execution efficiency of the improved ellipse algorithm is high.Figure 10
Comparison of the time used by the two algorithms. (a) Time data graph of the improved ellipse algorithm. (b) Time data plot of the traditionalDijkstra algorithm.
(a)(b)


## 4.2. Experimental Comparative Analysis of Rectangle Search Algorithm and TraditionalDijkstra Algorithm

The experimental data are selected from the real data of the team gym formation path of A. There are two indicators for evaluating the algorithm: the first is the number of nodes searched, and the second is the time spent searching the path.


### 4.2.1. Comparison of the Number of Nodes

As shown in Figure11, when traversing, the number of nodes in the rectangle search algorithm is much less than that of the traditional Dijkstra algorithm. When the straight line distance of the shortest path point pair to be found is the same, the rectangle search algorithm has a maximum of 451 nodes, while the traditional Dijkstra algorithm reaches 763 nodes. This shows that the efficiency of the rectangle search algorithm is better.Figure 11
Comparison of the time used by the two algorithms. (a) The number of nodes traversed data graph of the rectangle search algorithm. (b) TraditionalDijkstra algorithm node count traversal data graph.
(a)(b)


### 4.2.2. Comparison of Time Consumed When Searching for a Path

As shown in Figure12, as the straight-line distance between two nodes increases, the time consumed by the rectangle search algorithm to find the shortest path is much less than that of the Dijkstra algorithm.Figure 12
Time comparison of the two algorithms. (a) Graph of the time consumed by the rectangle search algorithm to search for a path. (b) A graph of the time spent in traditionalDijkstra searching for a path.
(a)(b)


## 4.2.1. Comparison of the Number of Nodes

As shown in Figure11, when traversing, the number of nodes in the rectangle search algorithm is much less than that of the traditional Dijkstra algorithm. When the straight line distance of the shortest path point pair to be found is the same, the rectangle search algorithm has a maximum of 451 nodes, while the traditional Dijkstra algorithm reaches 763 nodes. This shows that the efficiency of the rectangle search algorithm is better.Figure 11
Comparison of the time used by the two algorithms. (a) The number of nodes traversed data graph of the rectangle search algorithm. (b) TraditionalDijkstra algorithm node count traversal data graph.
(a)(b)


## 4.2.2. Comparison of Time Consumed When Searching for a Path

As shown in Figure12, as the straight-line distance between two nodes increases, the time consumed by the rectangle search algorithm to find the shortest path is much less than that of the Dijkstra algorithm.Figure 12
Time comparison of the two algorithms. (a) Graph of the time consumed by the rectangle search algorithm to search for a path. (b) A graph of the time spent in traditionalDijkstra searching for a path.
(a)(b)


## 4.3. Comparative Analysis of Ellipse Search Algorithm and Rectangle Search Algorithm

This paper compares the ellipse search algorithm with the rectangle search algorithm to find the optimal algorithm. The article will be evaluated from two aspects: the first is the search area and the second is the time consumed by the path search. Its area formula is shown in following formulas:(23)SR=4ab=4rr2−1od2,(24)SR=2a2+b2=22r2−1od2.


### 4.3.1. Comparison of Search Area

When the ratio of the search areas of the two algorithms reaches the minimum value, the number of nodes can be reduced while ensuring that the maximum area is within a reasonable range, as shown in following formulas:(25)SRmaxSellipse=2a2+b2πab=4r2−2πrr2−1,(26)SRminSellipse=4abπab≈1.27.As shown in Table2, when r=2, the ratio of the search area of the ellipse search algorithm to the rectangle search algorithm is the smallest and compared with the search area of the Dijkstra algorithm, the search area of the rectangle search algorithm is slightly larger than that of the ellipse search algorithm, but not much. But the rectangle search algorithm is more likely to find the shortest path than the ellipse search algorithm.Table 2
The ratio of the search area of the two algorithms.
The value of the coefficientrRectangle algorithm and ellipse algorithm search area ratio1.151.601.201.511.251.431.301.411.351.3751.401.36


### 4.3.2. Comparison of Search Time

It is not difficult to see from Table3 that when the distance between the two nodes of the shortest path to be found increases, the time used by the rectangle search algorithm is much lower than that of the ellipse search algorithm, and when the straight-line distance between two nodes is 1.5, the ellipse search algorithm takes 1.45 s, whereas the rectangle search algorithm takes only 0.3 s, which shows that the algorithm greatly saves the time used.Table 3
Time comparison of the two algorithms.
Algorithm search time (s)The straight-line distance of the shortest path point pair to be found (km)Ellipse search algorithmRectangle search algorithm0.50.201.00.350.11.51.450.32.01.731.32.51.981.453.02.11.763.53.21.894.03.982.1


## 4.3.1. Comparison of Search Area

When the ratio of the search areas of the two algorithms reaches the minimum value, the number of nodes can be reduced while ensuring that the maximum area is within a reasonable range, as shown in following formulas:(25)SRmaxSellipse=2a2+b2πab=4r2−2πrr2−1,(26)SRminSellipse=4abπab≈1.27.As shown in Table2, when r=2, the ratio of the search area of the ellipse search algorithm to the rectangle search algorithm is the smallest and compared with the search area of the Dijkstra algorithm, the search area of the rectangle search algorithm is slightly larger than that of the ellipse search algorithm, but not much. But the rectangle search algorithm is more likely to find the shortest path than the ellipse search algorithm.Table 2
The ratio of the search area of the two algorithms.
The value of the coefficientrRectangle algorithm and ellipse algorithm search area ratio1.151.601.201.511.251.431.301.411.351.3751.401.36


## 4.3.2. Comparison of Search Time

It is not difficult to see from Table3 that when the distance between the two nodes of the shortest path to be found increases, the time used by the rectangle search algorithm is much lower than that of the ellipse search algorithm, and when the straight-line distance between two nodes is 1.5, the ellipse search algorithm takes 1.45 s, whereas the rectangle search algorithm takes only 0.3 s, which shows that the algorithm greatly saves the time used.Table 3
Time comparison of the two algorithms.
Algorithm search time (s)The straight-line distance of the shortest path point pair to be found (km)Ellipse search algorithmRectangle search algorithm0.50.201.00.350.11.51.450.32.01.731.32.51.981.453.02.11.763.53.21.894.03.982.1


## 5. Discussion

Science and technology are primary productive forces. The comprehensive development of the Internet and the continuous breakthroughs in the computer field have contributed to the arrival of the era of big data and artificial intelligence. Big data can more and more accurately target the needs of target customers, and artificial intelligence will also replace traditional repetitive work, greatly improving the efficiency of people’s processing of things in life [29–31]. Through the comparison of ellipse search algorithm, rectangle search algorithm and traditional Dijkstra algorithm, and the comparison experiment between ellipse search algorithm and rectangle search algorithm, this paper explores the computer simulation algorithm of team gym formation path under artificial intelligence and big data [32]. And the following conclusions can be drawn:(1)
Through the comparative analysis between the ellipse search algorithm and the traditionalDijkstra algorithm, when the distance between the two nodes of the shortest path to be found increases, the search area of the ellipse search algorithm is significantly smaller than that of the Dijkstra algorithm. This shows that the ellipse search algorithm has excellent performance.(2)
Search path time comparison. When the distance between the two nodes of the shortest path to be found is relatively close, the time used by the two algorithms to search for the path is approximately the same as the time taken by theDijkstra algorithm.(3)
The comparison between the rectangle search algorithm and the traditionalDijkstra algorithm experiment. The number of nodes traversed by the two algorithms in the path-finding process increases as the distance between the two nodes of the shortest path to be found increases. This is because the number of nodes traversed by the algorithm is proportional to the area traversed by the algorithm.(4)
When the distance between the two nodes of the shortest path to be found increases, the time used by the two search algorithms increases. However, the time efficiency of the rectangle search algorithm is still higher than that of theDijkstra algorithm.(5)
The comparative analysis of the ellipse search algorithm and the rectangle search algorithm shows that the rectangle search algorithm has a higher probability of finding the shortest path, which shows that the reliability of the algorithm is better.(6)
The ellipse search algorithm needs to perform complex operations in the search process to determine whether a node falls within the ellipse, which takes a long time. The rectangle search algorithm only needs to compare the size of the coordinate values, which saves the time of the algorithm.The whole comparative test data show that the rectangular search algorithm improves the reliability of the algorithm and saves time compared with the ellipse search algorithm in terms of algorithm search area and search time. Therefore, the rectangle search algorithm has the best effect of optimizing theDijkstra algorithm.


## 6. Conclusion

In the era of the Internet, science and technology have undoubtedly promoted the advancement of various fields, including artificial intelligence, big data, and the Internet of Things. The computer simulation algorithm of group gymnastics formation transformation path has also obtained a new development direction under the Internet technologies such as big data and artificial intelligence. This paper chooses the adjacency list storage method to optimize theDijkstra algorithm when finding the shortest path in the gymnastics formation. Then, in view of the problems that the traditional Dijkstra algorithm has many search nodes, large range, and high time and space complexity in the process of finding the shortest path, through the experimental comparison of the rectangular search algorithm and the ellipse search algorithm, the rectangular search algorithm and the ellipse search algorithm are compared. The performance of the search algorithm is superior. Through the analysis of computer simulation results, in the actual group exercise process, the rectangular search algorithm can more efficiently find the travel route of each performer, thereby improving the efficiency of group exercises. In this paper, the area formulas of rectangle and ellipse search algorithms are also obtained according to the characteristics of group gymnastics formation transformation. This paper explores the computer simulation algorithm of group gymnastics formation change path and has achieved some results. Thereby, it promotes the progress of the related work of group gymnastics formation and has a very good application value. Team gymnastics formations are very complex and involve a wide range of areas. Due to the author’s limited time and energy, and the limitation of resources, this article has some shortcomings, such as optimizing other algorithms of the traditional Dijkstra algorithm. It does not take into account other interference factors that affect group gymnastics formation and the exercise effect of rectangle search algorithm on group gymnastics formation.



---

*Source: 2003301-2022-05-31.xml*