CN117771668A

CN117771668A - Dynamic display picture generation method and device

Info

Publication number: CN117771668A
Application number: CN202311868610.9A
Authority: CN
Inventors: 吴小鸥
Original assignee: WeBank Co Ltd
Current assignee: WeBank Co Ltd
Priority date: 2023-12-29
Filing date: 2023-12-29
Publication date: 2024-03-29

Abstract

The embodiment of the application provides a method and a device for generating a dynamic display picture, which are applied to the technical field of virtual reality and comprise the following steps: based on the scene triggering request, obtaining a layout path of a corresponding scene, wherein the layout path comprises M path nodes; sequentially obtaining a plurality of sub-path groups according to the advancing sequence of the M path nodes; each sub-path group comprises no more than a set number N of path nodes; the starting point path node in the ith sub-path group is the ending point path node of the ith-1 sub-path group; fitting the path nodes in each sub-path group to generate a sub-curve of each sub-path group; and taking the sub-curves of each sub-path group as the travelling track of the camera under the scene, thereby generating a dynamic display picture under the scene. Dividing the arrangement path, and respectively generating sub-curves of each sub-path group so that the travelling track of the camera is more attached to the arrangement path; local modification of path nodes is supported without affecting the sub-curves generated by the following sub-path group.

Description

Dynamic display picture generation method and device

Technical Field

The embodiment of the invention relates to the technical field of virtual reality, in particular to a method and a device for generating a dynamic display picture.

Background

With the progress and innovation of virtual reality technology, lens transformation in games is continuously evolved, from a fixed view angle to a 2D plane view angle and then to the development process of a 3D user operable view angle, a camera moves according to an arrangement path in a 3D scene, but when the camera moves to the corner of the arrangement path, the problem that obvious folding lines are not smooth occurs. In the prior art, a Bezier curve is adopted to generate a camera motion curve, so that the problem of unsmooth folding is solved.

However, in an actual 3D scene, when the number of nodes in the placement path is excessive, the difference between the generated camera motion curve and the placement path is large.

Disclosure of Invention

The embodiment of the application provides a method and a device for generating a dynamic display picture, which are used for generating a travelling track of a camera and generating the dynamic display picture according to the travelling track.

In a first aspect, an embodiment of the present application provides a method for generating a dynamic display screen, including:

based on a scene triggering request, acquiring a placement path of a corresponding scene, wherein the placement path comprises M path nodes; m is a positive integer;

sequentially obtaining a plurality of sub-path groups according to the advancing sequence of the M path nodes; wherein each sub-path group comprises no more than a set number N of path nodes; the starting point path node in the ith sub-path group is the ending point path node of the ith-1 sub-path group; n is a positive integer less than M, i is a positive integer greater than 1;

Fitting the path nodes in each sub-path group to generate a corresponding sub-curve of each sub-path group;

and taking the sub-curves corresponding to the sub-path groups as the advancing tracks of the cameras under the scene, thereby generating the dynamic display picture under the scene.

According to the method and the device, the arrangement paths are segmented according to the set number, a plurality of sub-path groups are obtained, the sub-curves of each sub-path group are generated respectively, and the finally obtained travelling track of the camera is more attached to the arrangement paths. In addition, after the placement path is segmented, the path nodes in the sub-path group can be supported to be locally modified without affecting the sub-curves generated by the following sub-path group.

Optionally, the connection between any two adjacent path nodes is a path branch line;

the ith sub-path group also comprises an ith auxiliary path node positioned behind the ith starting point path node; the i-th auxiliary path node is arranged on the extension line of the last path branch line in the i-1-th sub-path group.

Optionally, the setting position of the ith auxiliary path node meets the following conditions:

the distance between the ith starting point path node and the ith auxiliary path node is smaller than the distance of the last path branch in the ith-1 sub-path group;

The first path leg distance is less than a distance of a second path leg between the ith auxiliary path node and a next path node located after the ith origin path node in the deployment path.

Optionally, the i-th auxiliary path node is obtained by the following method, including:

setting the distance of the first path branch line to be equal to the product of the distance of the last path branch line in the ith-1 sub-path group and a distance coefficient; the distance coefficient has a set value range;

and randomly determining the value of the distance coefficient in the set value range, wherein the value satisfies that the distance of the first path branch line is smaller than that of the second path branch line.

Optionally, sequentially obtaining a plurality of sub-path groups according to the travelling sequence of the M path nodes, including:

taking the first G path nodes in the M path nodes as a head sub-path group according to the advancing sequence of the M path nodes, wherein G is a positive integer less than or equal to N;

taking any one of a non-head sub-path group and a non-tail sub-path group as an ith sub-path group, and taking a destination path node and an ith auxiliary path node of the ith-1 sub-path group as a preamble path node in the ith sub-path group;

Taking all path nodes except the destination path node and the i auxiliary path node of the i-1 th sub-path group in the i-th sub-path group as subsequent path nodes in the i-th sub-path group;

obtaining any intermediate sub-path group based on the preamble path node and the postamble path node;

if the k sub-path group is followed, an end path node is also present in the arrangement path;

and adding the end path node to the kth sub-path group to obtain an end sub-path group.

Optionally, the fitting the path nodes in each sub-path group to generate a sub-curve corresponding to each sub-path group includes:

determining a start path node, a process point and a termination path node of each path branch according to the path branch contained in each sub-path group; connecting the process points on two adjacent path branch lines to obtain a process branch line; the process branch line is provided with a middle dynamic point;

for adjacent first and second path legs at any instant, the following relationship exists:

the ratio of the distance between the first initial path node and the first process point to the first path leg length is equal to

The ratio of the distance between the second start path node and the second process point to the second path leg length is equal to

A ratio of a distance between the first process point and the intermediate dynamic point to a length of the process leg;

and forming a corresponding sub-curve of each sub-path group according to the motion trail of the intermediate dynamic point.

Optionally, before acquiring the placement path of the corresponding scene, the method further includes:

obtaining an arrangement path based on the setting of path setting personnel on each path node;

generating corresponding sub-curves of the arrangement paths according to the sub-path group mode;

splicing all the sub-curves into a travelling track of the camera and displaying the travelling track;

and receiving an adjustment instruction of a path setting person, and correspondingly updating the travelling track of the camera based on adjustment of the path nodes in the adjustment instruction until an arrangement path meeting scene requirements is obtained.

In a second aspect, an embodiment of the present application provides a generating device for a dynamic display screen, including:

the acquisition module is used for acquiring a placement path of a corresponding scene based on the scene triggering request, wherein the placement path comprises M path nodes; m is a positive integer;

the processing module is used for sequentially obtaining a plurality of sub-path groups according to the advancing sequence of the M path nodes; wherein each sub-path group comprises no more than a set number N of path nodes; the starting point path node in the ith sub-path group is the ending point path node of the ith-1 sub-path group; n is a positive integer less than M, i is a positive integer greater than 1;

the processing module is further used for fitting path nodes in each sub-path group to generate a corresponding sub-curve of each sub-path group;

the processing module is further configured to use the sub-curves corresponding to each sub-path group as a travel track of the camera in the scene, so as to generate a dynamic display picture in the scene.

Optionally, the acquiring module is specifically configured to:

the connecting line between any two adjacent path nodes is a path branch line;

Optionally, the processing module is specifically configured to:

the setting position of the ith auxiliary path node meets the following conditions:

Optionally, the processing module is specifically configured to:

the i-th auxiliary path node is obtained by the following steps:

Optionally, the processing module is specifically configured to:

In a third aspect, an embodiment of the present application provides a computer device, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, where the processor executes the method for generating a dynamic display screen according to any of the first aspect.

In a fourth aspect, an embodiment of the present application provides a computer readable storage medium storing a computer program executable by a computer device, where the program when executed on the computer device causes the computer device to perform the method for generating a dynamic presentation screen according to any of the first aspect.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it will be apparent that the drawings in the following description are only some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a flow chart of a method for generating a dynamic display picture according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of a sub-path group according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of a sub-path group according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of an arrangement path according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of an arrangement path according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of a sub-curve according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of a sub-curve according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of a sub-curve according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of a sub-curve according to an embodiment of the present invention;

fig. 10 is a schematic structural diagram of a dynamic display screen generating device according to an embodiment of the present invention;

fig. 11 is a schematic structural diagram of a computing device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

For ease of understanding, the terms involved in the embodiments of the present invention are explained below.

Field of View (FOV): i.e. field of view, camera field of view of the game engine. In a game, the FOV determines the range that a player can see in the game world. In general, the larger the value of the FOV, the wider the range that the player can see in the game.

UE Engine (universal Engine): the game engine developed by EPic Games supports multiple platforms, including PC, host, mobile device, virtual reality, augmented reality, etc., has powerful graphic rendering and blueprint system, and can create realistic game pictures and quickly create game logic and interactive behaviors. The UE engine is a game engine with open source codes, has huge community support, can be freely modified and customized by a developer to meet the own requirements, and is one of the preferred tools of the game developer.

Video Camera (Camera): in the UE engine, a Camera is used to control the viewing angle in the game. The camera may be set to different positions, rotations, and FOVs so that the player can view the scene in the game. Camera plays a very important role in games, and can determine the game scene seen by a player, so that the game experience is directly affected.

As shown in fig. 1, a flow chart of a method for generating a dynamic display screen provided in the present application specifically includes the following steps:

step S101, based on a scene trigger request, obtaining a layout path of a corresponding scene, wherein the layout path comprises M path nodes; m is a positive integer.

Specifically, different scenes have corresponding trigger time points and conditions, one scene pair has corresponding arrangement paths, and each path contains positive integer M path nodes. When a trigger request of a certain scene is acquired, acquiring a placement path corresponding to the scene.

Step S102, a plurality of sub-path groups are obtained in sequence according to the advancing sequence of M path nodes; wherein each sub-path group comprises no more than a set number N of path nodes; the starting point path node in the ith sub-path group is the ending point path node of the ith-1 sub-path group; n is a positive integer less than M, and i is a positive integer greater than 1.

Specifically, the path nodes in each arrangement path have a travelling sequence, and M path nodes in the arrangement paths are divided according to the travelling sequence by using a set number N, so that a plurality of sub-path groups are obtained, and each sub-path group contains the path nodes with the set number N. Wherein adjacent two sub-path groups have a common path node that is validated by: the starting point path node in the ith sub-path group is the ending point path node of the ith-1 sub-path group. For example, if i is equal to 2, then the start path node in the 2 nd sub-path group is the end path node of the 1 st sub-path group. In the present application, the value of N may be 3, 4, or 5, and when the sub-path groups of the M path nodes are divided, any sub-path group other than the non-last sub-path group may be divided according to actual requirements, for example, the M path nodes are all divided into sub-path groups according to 3 path nodes, for example, the M path nodes are all divided into sub-path groups according to 4 path nodes, and for example, the M path nodes are all divided into sub-path groups according to 3 path nodes; or dividing the sub-path groups of the M path nodes according to any two values of three values of 3, 4 and 5; or dividing the M path nodes into sub path groups with unlimited sequence according to three values of 3, 4 and 5, wherein the unlimited sequence means that the number of the path nodes in each sub path group is randomly determined.

Step S103, fitting the path nodes in each sub-path group to generate a corresponding sub-curve of each sub-path group.

Step S104, taking the corresponding sub-curves of each sub-path group as the travelling tracks of the cameras under the scene, thereby generating a dynamic display picture under the scene.

In the application, the following method may be used to fit the path nodes in each sub-path group, so as to generate a corresponding sub-curve of each sub-path group:

determining a start path node, a process point and a termination path node of each path branch according to the path branch contained in each sub-path group; connecting the process points on two adjacent path branch lines to obtain a process branch line; the process branch line is provided with a middle dynamic point; for adjacent first and second path legs at any instant, the following relationship exists: the ratio of the distance between the first starting path node and the first process point to the length of the first path branch is equal to the ratio of the distance between the second starting path node and the second process point to the length of the second path branch, and the ratio of the distance between the first process point and the intermediate dynamic point to the length of the process branch is equal to the ratio of the distance between the first process point and the intermediate dynamic point; and forming a corresponding sub-curve of each sub-path group according to the motion trail of the middle dynamic point.

Specifically, as shown in fig. 2, the sub-path group includes 3 path nodes, P1P2 is a first path branch, P1 is a first start path node, P2 is a first end path node, and P12 is a first process point; P2P3 is a second path leg, P2 is a first start path node, P3 is a first end path node, P23 is a first process point; p is an intermediate dynamic point, and for the first path leg and the second path leg, the following relationship exists: p1p12/p1p2=p2p23/p2p3=p12p/p1p1p23.

The original movement route of the camera is P1P2P3 (P1- > P2- > P3 path), the P1 point coordinates Pos1 (Xa, ya, za), the P2 point coordinates Pos2 (Xb, yb, zb) and the P3 point coordinates Pos3 (Xc, yc, zc) are known, tac seconds are needed for the movement of the camera from the P1 point to the P3 point, and the moment T (0.ltoreq.T.ltoreq.Tac) and the position CPos of the camera are needed to be calculated; assuming that Tac seconds walk from P1 to P2 and likewise Tac seconds walk from P2 to P3, then at time T, the point of the P1P2 path walks to P12, and the coordinates we mark as Pos12; the point on the P2P3 path goes to P23, we mark the coordinate as Pos23; on the connected P12P23, we find the point P at time T as well, and the coordinates we mark as Pos.

Pos 12= (1-T/Tac) Pos1+ T/Tac Pos2 … formula 1

Pos23= (1-T/Tac) Pos2+T/Tac Pos3 … equation 2

Pos= (1-T/Tac) Pos12+ T/Tac Pos23 … formula 3

Combining the above formulas 1, 2, 3 yields:

Pos＝(1-T/Tac)*((1-T/Tac)*Pos1+T/Tac*Pos2)+T/Tac*((1-T/Tac)*Pos2+T/Tac*Pos3)

＝(1-T/Tac)2*Pos1+2*T/Tac*(1-T/Tac)*Pos2+(T/Tac)2*Pos3

… equation 4

Since Pos1, pos2, pos3, tac are known constants, the above calculation (i.e., the P-point motion trajectory equation) is expressed by the following equation 5 if a mathematical function is used:

f (x) = (1-x) 2 x a+2 x (1-x) b+ (x) 2 x c, x e [0,1] … formula 5

Where a, b, c are constants (Pos 1, pos2, pos3, respectively), x=t/Tac, and f (x) is a quadratic function, which is a rounded continuous curve.

As shown in fig. 3, the sub-path group contains 4 path nodes, and the original movement route of the camera is P1P2P3P4P (P1- > P2- > P3- > P4 path); knowing the P1 point coordinates Pos1 (Xa, ya, za), the P2 point coordinates Pos2 (Xb, yb, zb), the P3 point coordinates Pos3 (Xc, yc, zc), the P4 point coordinates Pos4 (Xd, yd, zd), the camera motion from the P1 point to the P4 point takes Tad seconds, we need to calculate any time T (0.ltoreq.T.ltoreq.tad), the camera position CPos. Assuming that Tad seconds walk from P1 to P2, tad seconds walk from P2 to P3, tad seconds walk from P3 to P4, then at time T, the point of the P1P2 path walks to P12, and the path node in each sub-path group is marked as Pos1; the point on the P2P3 path goes to P23, the point on the P3P4 path goes to P34, the point on the P2P 4 path is marked as Pos2, the point on the P3P4 path is marked as Pos3, the point on the P12P23 path is marked as Pos13, the point on the P23 path is marked as Pos24, the point on the P24 path is marked as Pos24, and the point on the P13P24 path is marked as Pos.

Pos13＝(1-T/Tad)2*Pos1+2*T/Tad*(1-T/Tad)*Pos2+(T/Tad)2*Pos3

… equation 6

Pos24＝(1-T/Tad)2*Pos2+2*T/Tad*(1-T/Tad)*Pos3+(T/Tad)2*Pos4

… equation 7

Pos= (1-T/Tad) Pos13+ T/Tad Pos24 … formula 8

The above equations 6, 7, 8 are combined to obtain the following equation 9:

Pos＝(1-T/Tad)*[(1-T/Tad)2*Pos1+2*T/Tad*(1-T/Tad)*Pos2+(T/Tad)2*Pos3]+T/Tad*[(1-T/Tad)2*Pos2+2*T/Tad*(1-T/Tad)Pos3+(T/Tad)2*Pos4]

＝(1-T/Tad)3*Pos1+3*(T/Tad)*(1-T/Tad)2*Pos2+3*(T/Tad)2*(1-T/Tad)*Pos3

+ (T/Tad) 3 x Pos4 … equation 9

Since Pos1, pos2, pos3, pos4, tad are known constants, the above calculation result (i.e., the P-point motion trajectory equation) is expressed by using a mathematical function, as shown in the following equation 10:

f(x)＝(1-x)3*a+3*x*(1-x)2*b+3*x ² *(1-x)*c+x ³ *c，x∈[0,1]

… equation 10

Where a, b, c, d are constants (Pos 1, pos2, pos3, pos4, respectively), x=t/Tad, and f (x) is a cubic function, which is a rounded continuous curve.

In the above two examples of the bezier curve algorithm, similarly, when the sub-path groups contain 5, 6, and other path nodes, the obtained sub-curves corresponding to each sub-path group can be obtained.

In the application, the connecting line between any two adjacent path nodes is a path branch line; the ith sub-path group also comprises an ith auxiliary path node positioned behind the ith starting point path node; the i-th auxiliary path node is disposed on the extension of the last path leg in the i-1-th sub-path group.

Specifically, an auxiliary path node is added in the 2 nd sub-path group and the sub-path group following the 2 nd sub-path group. Taking the 2 nd sub-path group as an example, an auxiliary path node is added after the starting path node in the 2 nd sub-path group, and the auxiliary path node is arranged on the extension line of the last path branch line in the 1 st sub-path group. As shown in the arrangement path of fig. 4, P1, P2, P3, P4 are the 1 st sub-path group, P4, Q1, P5, P6 are the 2 nd sub-path group, where Q1 is an auxiliary path node of the start path node P4 of the 2 nd sub-path group, and the auxiliary path node Q1 is disposed on an extension line of the path branch line between the P3P 4 path nodes in the 1 st sub-path group.

Taking the first G path nodes in the M path nodes as a head sub-path group according to the advancing sequence of the M path nodes, wherein G is a positive integer less than or equal to N; taking any one of the non-head sub-path group and the non-tail sub-path group as an ith sub-path group, and taking a destination path node and an ith auxiliary path node of the ith-1 sub-path group as a preamble path node in the ith sub-path group; taking all path nodes except the destination path node and the i auxiliary path node of the i-1 th sub path group in the i-th sub path group as subsequent path nodes in the i-th sub path group; obtaining any intermediate sub-path group based on the preamble path node and the postamble path node; if the k sub-path group is followed, an end path node exists in the arrangement path; and adding the end path node to the kth sub-path group to obtain an end sub-path group.

For example, the arrangement path as shown in fig. 5 includes 9 path nodes, P1, P2, P3, P4, P5, P6, P7, P8, P9, respectively. Wherein, the P1 coordinate is (144,337,20), the P2 coordinate is (226,162,20), the P3 coordinate is (346,97,20), the P4 coordinate is (324,282,20), the P5 coordinate is (439,382,20), the P6 coordinate is (515,251,20), the P7 coordinate is (549,161,20), the P8 coordinate is (724,62,20), and the P9 coordinate is (660,377,20). Setting the number N to 4, then following the 1 st sub-path group: p1, P2, P3, P4; the 1 st auxiliary path node Q1 is added after the start path node P4 of the 2 nd sub path group, and the 2 nd sub path group: p4, Q1, P5, P6; the 2 nd auxiliary path node Q2 is added after the start path node P6 of the 3 rd sub path group, and the 3 rd sub path group: p6, Q2, P7, P8, at which time there is an end path node P9, then the end path node P9 is added to the 3 rd sub-path group, and the 3 rd sub-path group finally obtained is P6, Q2, P7, P8, P9. In other words, the 1 st sub-path group is the head sub-path group; the 2 nd sub-path group is an intermediate sub-path group; the 2 nd sub-path group is the last sub-path group.

Wherein the setting position of the i-th auxiliary path node satisfies the following condition: the distance between the ith starting point path node and the ith auxiliary path node is smaller than the distance of the last path branch in the ith-1 sub-path group; the first path leg distance is less than the distance of the second path leg between the ith auxiliary path node and a next path node located after the ith origin path node in the deployment path.

Taking the arrangement path in fig. 5 as an example, P1P 2P 3P4 is the 1 st sub-path group, and P4Q 1P 5P 6 is the 2 nd sub-path group. Wherein the distance of the first path leg between Q1P4 is smaller than the distance of the path legs between the P3P4 path nodes in the 1 st sub-path group, i.e., |p4q1| < |p3p4|; and the distance of the first path leg between Q1P4 is smaller than the distance of the second path leg between the auxiliary path node Q1 and the next path node P5 after the auxiliary path node Q1 (P5 is the latter path node of P4 among the placement paths P1, P2, P3, P4, P5, P6, P7, P8, P9), i.e., |p4q1| < |q1p5|.

The above describes that the conditions are satisfied when the auxiliary path node is set, then the i-th auxiliary path node is obtained specifically by: setting the distance of the first path branch line to be equal to the product of the distance of the last path branch line in the ith-1 sub-path group and a distance coefficient; the distance coefficient has a set value range; and randomly determining the value of the distance coefficient within a set value range, wherein the value satisfies that the distance of the first path branch line is smaller than that of the second path branch line.

Specifically, the distance coefficient is set to k, and the 2 nd sub-path group of the paths is arranged in fig. 5: p4, Q1, P5, P6 are examples, in which case a distance coefficient k1 is defined; |p4q1|=k1|p3p4|. Wherein k1 ε (0, 1);

the range of the distance coefficient k1 is determined as follows:

when k1>1, assuming k1=1.5, the Q1 coordinate at this time is about (291,560,20), at this time:

the conditions of |p4q1| < p3p4| and |p4q1| < q1p5| are not satisfied, and for this time the 2 nd sub-path group: the generated sub-curves of P4, Q1, P5, and P6 are shown in fig. 6, and the generated sub-curves deviate greatly from the original 2 nd sub-path. When 0< k1<1, it is assumed that k1=0.09, the Q1 coordinate at this time is about (322, 299, 20), at which time:

the conditions of |p4q1| < |p3p4| and |p4q1| < q1p5| are satisfied, and for this time the 2 nd sub-path group: the generated sub-curves of P4, Q1, P5 and P6 are shown in fig. 7, and the deviation of the generated sub-curves from the original 2 nd sub-path is small.

The 3 rd sub-path group of paths is arranged in fig. 5: for example, P6, Q2, P7, and P8 are P9 only after the 3 rd sub-path group, and thus the 3 rd sub-path group is finally obtained: p6, Q2, P7, P8, P9. Defining a distance coefficient as k2 in this example; |p6q2|=k2|p5p6|. Wherein k 2E (0, 1);

The range of the distance coefficient k2 is determined as follows:

when k2>1, assuming k2=1.5, the Q2 coordinate at this time is about (629,54.5,20), at this time:

the conditions of |p6q2| < |p5p6| and |p6q2| < |q2p7| are not satisfied, and for this time the 3 rd sub-path group: the generated sub-curves of P6, Q2, P7, P8, and P9 are shown in fig. 8, and the generated sub-curves deviate greatly from the original 3 rd sub-path.

When 0< k2<1, it is assumed that k2=0.3, the Q2 coordinate at this time is about (537.8, 211.7, 20), at which time:

the conditions of |p6q2| < p5p6| and |p6q2| < q2p7| are satisfied, and for this time the 3 rd sub-path group: the generated sub-curves of P6, Q2, P7, P8, and P9 are shown in fig. 9, and the generated sub-curves have small deviations from the original 3 rd sub-path.

Therefore, in the present application, the range of the distance coefficient k is k e (0, 1), and the value of the distance coefficient is determined randomly, so that the distance of the first path branch line is equal to the product of the distance of the last path branch line in the i-1 th sub-path group and the distance coefficient.

Before obtaining the arrangement path of the corresponding scene, the method further comprises: obtaining an arrangement path based on the setting of path setting personnel on each path node; generating corresponding sub-curves of the arrangement paths according to the sub-path group; splicing all the sub-curves into a travelling track of the camera and displaying the travelling track; and receiving an adjustment instruction of a path setting person, and correspondingly updating the travelling track of the camera based on adjustment of the path nodes in the adjustment instruction until an arrangement path meeting scene requirements is obtained.

Specifically, a path setting person sets a layout path according to an application scene, generates corresponding sub-curves according to the layout path, and displays the travelling track of the camera after all the self-curves are spliced. If the display effect does not accord with the ideal effect, the path setting personnel can adjust the path nodes, and then a new travelling track of the camera can be generated according to the adjusted path nodes until an arrangement path meeting the scene requirement is obtained.

In the application, as the arranged path is segmented, local modification of the path points can be supported without influencing the following sub-curves, and when the path nodes in the sub-path groups are modified, at most, only the curves corresponding to the two sub-path groups are influenced: the curves of the current set and the curves of the next sub-path set are modified without affecting the curves of the other sets (when the points where the two sets of curves join are modified, the two sets of curves that affect the join are also affected). For example, modifying the position of the P2 point in the placement path of fig. 5 only affects the curves generated in the 1 st sub-path group, but not the curves generated in the 2 nd sub-path group and the 3 rd sub-path group; if the position of the P3 point is modified, the curves generated by the 1 st sub-path group and the 2 nd sub-path group are influenced, and the curves generated by the 3 rd sub-path group are not influenced; if the position of the connection point P4 is modified, the curves generated by the 1 st sub-path group and the 2 nd sub-path group are influenced, and the curves generated in the 3 rd sub-path group are not influenced; if the position of the point P6 of the connection point is modified, the curves generated by the 2 nd sub-path group and the 3 rd sub-path group are affected, and the curves generated by the 1 st sub-path group are not affected. In addition, the shape of the curve can be intuitively predicted after grouping, the calculation complexity is reduced, and the 8 th power function is reduced to 2 th power and 3 rd power and fourth power functions in the prior art.

As shown in fig. 10, a device 1000 for generating a dynamic display screen according to an embodiment of the present application includes:

an obtaining module 1001, configured to obtain, based on a scenario triggering request, a placement path of a corresponding scenario, where the placement path includes M path nodes; m is a positive integer;

a processing module 1002, configured to sequentially obtain a plurality of sub-path groups according to a travelling order of the M path nodes; wherein each sub-path group comprises no more than a set number N of path nodes; the starting point path node in the ith sub-path group is the ending point path node of the ith-1 sub-path group; n is a positive integer less than M, i is a positive integer greater than 1;

the processing module 1002 is further configured to fit path nodes in each sub-path group, and generate a sub-curve corresponding to each sub-path group;

the processing module 1002 is further configured to use the sub-curves corresponding to each sub-path group as a travel track of the camera in the scene, so as to generate a dynamic display picture in the scene.

Optionally, the obtaining module 1001 is specifically configured to:

the connecting line between any two adjacent path nodes is a path branch line;

Optionally, the processing module 1002 is specifically configured to:

the i-th auxiliary path node is obtained by the following steps:

Optionally, the processing module 1002 is specifically configured to:

Based on the same technical concept, the embodiment of the present application provides a computer device, as shown in fig. 11, including at least one processor 1101 and a memory 1102 connected to the at least one processor, where a specific connection medium between the processor 1101 and the memory 1102 is not limited in the embodiment of the present application, and in fig. 11, the processor 1101 and the memory 1102 are connected by a bus, for example. The buses may be divided into address buses, data buses, control buses, etc.

In the embodiment of the present application, the memory 1102 stores instructions executable by the at least one processor 1101, and the at least one processor 1101 can execute the steps of the method for generating a dynamic presentation screen by executing the instructions stored in the memory 1102.

The processor 1101 is a control center of the computer device, and may use various interfaces and lines to connect various parts of the computer device, and execute or execute instructions stored in the memory 1102 and invoke data stored in the memory 1102, thereby generating a dynamic presentation screen in a corresponding scene. Alternatively, the processor 1101 may include one or more processing units, and the processor 1101 may integrate an application processor and a modem processor, wherein the application processor primarily processes an operating system, a user interface, an application program, and the like, and the modem processor primarily processes wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 1101. In some embodiments, the processor 1101 and the memory 1102 may be implemented on the same chip, and in some embodiments they may be implemented separately on separate chips.

The processor 1101 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, that can implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution.

Memory 1102 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 1102 may include at least one type of storage medium, and may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 1102 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer device, but is not limited to such. The memory 1102 in the present embodiment may also be circuitry or any other device capable of implementing a memory function for storing program instructions and/or data.

Based on the same inventive concept, the embodiments of the present application provide a computer-readable storage medium storing a computer program executable by a computer device, which when run on the computer device, causes the computer device to perform the steps of the above-described dynamic presentation screen generating method.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to cover such modifications and variations.

Claims

1. A method for generating a dynamic display screen, the method comprising:

2. The method of claim 1, wherein the connection between any two adjacent path nodes is a path leg;

3. The method of claim 2, wherein the set position of the i-th auxiliary path node satisfies the following condition:

4. A method according to claim 3, wherein the i-th auxiliary path node is obtained by:

5. The method of claim 2, wherein sequentially obtaining a plurality of sub-path groups according to the traveling order of the M path nodes, comprises:

6. The method of any one of claims 1 to 5, wherein said fitting path nodes in each sub-path group to generate a corresponding sub-curve for each sub-path group comprises:

a ratio of a distance between the first start path node and the first process point to the first path leg length is equal to;

a ratio of a distance between the second starting path node and the second process point to the second path leg length is equal to;

7. The method according to any one of claims 1 to 5, further comprising, before the acquiring the placement path of the corresponding scene:

8. A dynamic display screen generating apparatus, comprising:

9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of any of claims 1-7 when the program is executed.

10. A computer readable storage medium, characterized in that it stores a computer program executable by a computer device, which program, when run on the computer device, causes the computer device to perform the steps of the method according to any one of claims 1-7.