A method and system for automatically generating markers for curved boundary scenes in VR applications

Abstract

This invention provides an automatic marker generation method and system for curved boundary scenes in VR applications, relating to the field of virtual reality. The method includes: representing the target curved boundary scene in the VR application using curved polygons; subdividing the curved polygons to obtain a set of sub-polygons; constructing a set of potential marker positions by using a polygon intersection set method, where the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set is taken as the potential location of the marker; and constructing a multiple coverage location problem based on the potential location set, the sub-polygon set, and a given number of markers, using sub-polygons as covered points and the potential locations of the markers as covering points, and solving for the optimal marker position set under a marker number constraint, with the objective of maximizing the number of covered points. This invention improves the tracking accuracy of user positions in feature-scarce physical environments, thereby further enhancing the user immersion experience and system adaptability in VR systems.

Description

Technical Field

[0001] This invention relates to the field of virtual reality, and more specifically to a method and system for automatically generating markers for curved boundary scenes in VR applications. Background Technology

[0002] In multi-user, large-space VR (Virtual Reality) applications based on real-walking interaction, accurate user positioning and tracking is a critical issue affecting user experience. Currently, practical applications primarily employ feature-based tracking methods, which locate users by capturing salient visual features such as edges, corners, spots, and patches. However, when the real environment contains large areas of uniformity (e.g., white walls) or repetitive textures (e.g., tiles), this method is prone to positioning errors, leading to inaccurate calculations of user spatial coordinates. It is worth noting that even when richly patterned designs are affixed to the wall, intermittent positioning drift still occurs using this type of method.

[0003] To address this, some VR applications employ marker-based tracking, utilizing predefined markers placed in the real environment to achieve more reliable user tracking. However, current marker placement relies primarily on human experience and observation, a time-consuming and labor-intensive process, and the effectiveness of marker placement is questionable. While setting more markers can improve tracking accuracy, it affects the viewing experience and increases costs. Therefore, existing VR applications, especially in complex scenes with curved boundaries, lack a method for automatically generating a limited number of marker positions, hindering efficient assistance in achieving accurate user positioning and tracking. Summary of the Invention

[0004] To address the aforementioned issues, this invention proposes an automatic marker generation method and system for curved boundary scenes in VR applications, which improves the tracking accuracy of user positions in feature-scarce physical environments, thereby further enhancing the user immersion experience and system adaptability in VR systems.

[0005] According to some embodiments, the present invention adopts the following technical solution:

[0006] A method for automatically generating markers for curved boundary scenes in VR applications includes:

[0007] The target curved boundary scene in the VR application is represented by a curved polygon, and the curved polygon is subdivided to obtain a set of sub-polygons;

[0008] Using the polygon intersection set method, the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set is used as the potential location of the marker, and a potential location set of the marker is constructed.

[0009] Based on the set of potential locations, the set of sub-polygons, and the given number of markers, a multi-coverage location problem is constructed. The sub-polygons are the covered points, and the potential locations of the markers are the covering points. Under the constraint of the number of markers, the goal is to maximize the number of covered points and find the optimal set of marker locations.

[0010] According to some embodiments, the present invention adopts the following technical solution:

[0011] An automatic marker generation system for curved boundary scenes in VR applications includes:

[0012] The polygon subdivision module is configured to: represent the target curved boundary scene in the VR application using curved polygons, and subdivide the curved polygons to obtain a set of sub-polygons;

[0013] The latent location construction module is configured to: construct a set of latent locations for the marker by taking the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set as the latent locations of the marker using the polygon intersection set method;

[0014] The marker location solution module is configured to: construct a multiple coverage location problem based on the potential location set, the sub-polygon set, and the given number of markers; take the sub-polygons as the covered points and the potential locations of the markers as the coverage points; and, under the constraint of the number of markers, solve for the optimal set of marker locations with the objective of maximizing the number of covered points.

[0015] According to some embodiments, the present invention adopts the following technical solution:

[0016] A computer program product includes a computer program that, when executed by a processor, implements the method for automatically generating markers for curved boundary scenes in a VR application.

[0017] According to some embodiments, the present invention adopts the following technical solution:

[0018] A non-transitory computer-readable storage medium is provided for storing computer instructions, which, when executed by a processor, implement the method for automatically generating markers for curved boundary scenes in a VR application.

[0019] According to some embodiments, the present invention adopts the following technical solution:

[0020] An electronic device includes a processor, a memory, and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device is running, the processor executes the computer program stored in the memory to enable the electronic device to implement the automatic generation method for markers of curved boundary scenes in a VR application.

[0021] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0022] This invention divides a given curved polygon representing a physical scene into sub-polygon sets. For each sub-polygon set, a set of potential locations for markers is obtained using the Polygon Intersection Point Set (PIPS) method. Based on the potential location set, the sub-polygon set, and a given number of markers, a Maximum Coverage Location Problem (MCLP) is constructed and solved to obtain the optimal set of markers. This enables the automatic generation of marker locations in a physical scene represented by curved polygons, allowing developers to quickly deploy markers in any type of physical scene with scarce features, thereby ensuring accurate tracking of user positions in VR applications. Attached Figure Description

[0023] The accompanying drawings, which form part of this invention, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an improper limitation of the invention.

[0024] Figure 1 This is a schematic diagram of the automatic generation process of marker positions in Example 1;

[0025] Figure 2 This is a schematic diagram of the sub-polygons after spatial division in Example 1;

[0026] Figure 3 This is a schematic diagram of the subdivision of the type 2 sub-polygon in Example 1;

[0027] Figure 4 This is a detailed schematic diagram of Case 1, where the type 3 sub-polygon is shown in Example 1.

[0028] Figure 5 This is a detailed breakdown diagram of Case 2 of Type 3 sub-polygon in Example 1;

[0029] Figure 6 This is a detailed schematic diagram of Case 1, where the type 4 sub-polygon is shown in Example 1.

[0030] Figure 7 This is a detailed schematic diagram of case 2 of type 4 sub-polygon in Example 1;

[0031] Figure 8 This is a detailed diagram of case 3 of type 4 sub-polygon in Example 1;

[0032] Figure 9 This is a detailed schematic diagram of Case 1, where the type 5 sub-polygon is shown in Example 1.

[0033] Figure 10 This is a detailed breakdown diagram of case 2 of type 5 sub-polygon in Example 1;

[0034] Figure 11 This is a detailed schematic diagram of case 3 of type 5 sub-polygon in Example 1;

[0035] Figure 12 This is a detailed diagram of case 4 of type 5 sub-polygon in Example 1;

[0036] Figure 13 This is a schematic diagram of all the subdivided sub-polygons in Example 1;

[0037] Figure 14 This is a schematic diagram of the coverage area in Example 1;

[0038] Figure 15 This is a schematic diagram of the intersection of the coverage areas of the two sub-polygons in Example 1. Detailed Implementation

[0039] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0040] It should be noted that the following detailed descriptions are exemplary and intended to provide further illustration of the invention. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0041] It should be noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of exemplary embodiments according to the invention. As used herein, the singular form is intended to include the plural form as well, unless the context clearly indicates otherwise. Furthermore, it should be understood that when the terms "comprising" and / or "including" are used in this specification, they indicate the presence of features, steps, operations, devices, components, and / or combinations thereof.

[0042] Example 1

[0043] One embodiment of the present invention provides a method for automatically generating markers for curved boundary scenes in VR applications, comprising:

[0044] Step S1: Represent the target curved boundary scene in the VR application using curved polygons, and subdivide the curved polygons to obtain a set of sub-polygons;

[0045] Step S2: Using the polygon intersection set method, the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set is taken as the potential location of the marker, and a potential location set of the marker is constructed.

[0046] Step S3: Based on the potential location set, the sub-polygon set, and the given number of markers, construct a multiple coverage location problem. With the sub-polygons as the covered points and the potential locations of the markers as the coverage points, under the constraint of the number of markers, the goal is to maximize the number of covered points and solve for the optimal set of marker locations.

[0047] As one embodiment, the present invention provides an automatic marker generation method for curved boundary scenes in VR applications, which can improve the tracking accuracy of user positions in feature-sparse physical environments, thereby further enhancing the user immersion experience and system adaptability in VR systems. Figure 1 As shown, the specific implementation process is as follows:

[0048] Step 1: Divide the given curved polygon representing the physical scene into sub-polygon sets, including:

[0049] Step (1.1): Using the Voronoi-based decomposition (VBD) method, the curved polygon is spatially partitioned to obtain the following... Figure 2 The diagram shows several sub-polygons, among which... Figure 2 The numbers marked in the text are the type numbers of the sub-polygons.

[0050] Step (1.2): Further subdivide each sub-polygon until the radius of the smallest circumcircle of all sub-polygons is less than a given threshold.

[0051] For each sub-polygon, it is further subdivided according to its type using different methods, specifically:

[0052] Step (1.2.1): For a Type 1 sub-polygon formed by three diagonals, the subdivision method is as follows:

[0053] First, find the vertex with the largest interior angle. Draw a perpendicular point from that vertex to its opposite side. The line segment from the vertex to the perpendicular point divides the type 1 subpolygon into two type 1 subtriangles.

[0054] Step (1.2.2): For a type 2 sub-polygon formed by a diagonal and a curve, such as Figure 3 As shown, the subdivision method is as follows:

[0055] First, find the point on the curve that is farthest from the diagonal, and then connect that point to the endpoint of the diagonal to divide the type 2 subpolygon into a type 1 subpolygon and a type 2 subpolygon.

[0056] Step (1.2.3): For a type 3 sub-polygon formed by two diagonals and a curve, the subdivision method has two cases:

[0057] If the curve is convex, such as Figure 4 As shown, connecting the endpoints of the curve divides the type 3 sub-polygon into a type 1 sub-polygon and a type 2 sub-polygon.

[0058] If the curve is concave, such as Figure 5 As shown, find the point on the curve that is farthest from the line segment connecting the endpoints of the curve, and then draw a parallel line from that point to intersect the line segment, thereby dividing the type 3 sub-polygon into one type 1 sub-polygon and two type 3 sub-polygons.

[0059] Step (1.2.4): For a type 4 sub-polygon formed by one diagonal and two curves, the subdivision method has three cases:

[0060] If one curve is convex and the other is concave, such as Figure 6 As shown, find the point on the concave curve that is farthest from the line segment connecting the endpoints of the concave curve, and then draw a parallel line from that point to intersect the line segment, thereby dividing the type 4 sub-polygon into two type 3 sub-polygons and one type 4 sub-polygon.

[0061] If both curves are concave, such as Figure 7 As shown, find the point on the concave curve that is farthest from the line segment connecting the endpoints of the concave curve, and then draw a parallel line from that point to intersect the line segment, thereby dividing the type 4 sub-polygon into two type 3 sub-polygons and one type 4 sub-polygon.

[0062] If both curves are convex, such as Figure 8 As shown, the endpoints of each curve are connected to divide type 4 into two type 2 sub-polygons and one type 1 sub-polygon.

[0063] Step (1.2.5): For a type 5 sub-polygon consisting of two diagonals and two curves, the subdivision method is divided into four cases:

[0064] If both curves are convex, such as Figure 9 As shown, by connecting the endpoints of each curve, type 5 is divided into a quadrilateral and two type 2 sub-polygons, which are further divided into two type 1 sub-polygons by connecting one of their diagonals.

[0065] If both curves are concave, find two parallel lines. If these two parallel lines do not intersect the other curve, then... Figure 10 As shown, a type 5 sub-polygon will be divided into one quadrilateral and four type 3 sub-polygons; otherwise, as... Figure 11 As shown, find the common tangent of the two curves and divide type 5 into four type 3 sub-polygons.

[0066] If one curve is concave and the other is convex, such as Figure 12 As shown, a parallel line is found for the concave curve and connected to the endpoints of the convex curve, thereby dividing type 5 into a quadrilateral, a type 2 sub-polygon, and two type 3 sub-polygons. The quadrilateral is further divided into two type 1 sub-polygons by connecting one of its diagonals.

[0067] Step (1.3): Use all the subdivided sub-polygons as the subdivision result, to obtain the following... Figure 13 The set of sub-polygons shown.

[0068] Step 2: For a given curved polygon and a set of polygons, obtain the set of potential locations for the markers using the PIPS method, including:

[0069] Step (2.1): Calculate the coverage boundary of each sub-polygon, specifically:

[0070] like Figure 14 As shown, with each vertex of the sub-polygon as its center, a circle with a radius equal to the given marker recognition range is drawn. The overlapping portion of all circles constitutes the coverage boundary of the sub-polygon. Figure 14 In the diagram, the red triangle represents the sub-polygon whose coverage boundary needs to be calculated, the yellow line represents the drawn circle, and the green line represents the coverage boundary.

[0071] The above method yields the coverage boundaries of all sub-polygons.

[0072] Step (2.2): As Figure 15 As shown, the intersection of the covering boundaries of any two sub-polygons is calculated, and the intersection is used as a potential location for the marker, thus obtaining the set of all potential locations.

[0073] Step 3: Based on the set of potential locations of the markers, the set of sub-polygons, and the given number of markers, construct the MCLP, using sub-polygons as covered points and potential locations of the markers as covered points. Under the constraint of the number of markers, with the objective of maximizing the number of covered points, solve for the optimal set of marker locations, including:

[0074] Step (3.1): Let This represents the set of potential locations for the markers, i.e., the set of coverage points. Let B represent the set of sub-polygons, i.e., the set of covered points. Let B be the given number of markers, i.e., the upper limit of the number of markers. There is a covering relationship between covered points and covering points. Here, the covering relationship is expressed by the latent positions of the markers. Is it in the sub-polygon? Characterized by the coverage boundary, Indicates the ability to cover sub-polygons The set of potential locations of the markers, Indicates potential locations that can be marked. The set of covered sub-polygons.

[0075] Step (3.2): Construct MCLP, , , , , .

[0076] in, Indicates the potential location of the marker. Set a tag, Indicates the potential location of the marker. Do not set a flag; Representing sub-polygons Covered by at least one potential location of the marker, i.e., the potential location of the marker. In sub-polygon On the coverage boundary, Representing sub-polygons It is not covered by any potential location of the marker. By the set of potential locations marked Sub-polygon set It can be obtained, and These are the decision variables to be solved.

[0077] Step (3.3): Solve the MCLP in step (3.2) using the branch-and-bound method, specifically as follows:

[0078] First, relax the integer constraints to obtain the upper bound and use a greedy algorithm to generate the initial lower bound. Then, branch by selecting a fractional variable (forced placement or no placement of markers), calculate the relaxed solution of the subproblem and prune invalid branches. Finally, output the optimal marker placement when the termination condition is met. .

[0079] This embodiment provides a method and system for automatically generating markers in curved boundary scenes in VR applications. It enables the automatic generation of marker positions in physical scenes represented by curved polygons, allowing developers to quickly place markers in physical scenes with scarce features, ensuring accurate tracking of user positions in VR applications. It can be widely used in the generation of virtual road maps for predictive redirection controllers in curved scenes.

[0080] Example 2

[0081] One embodiment of the present invention provides an automatic marker generation system for curved boundary scenes in VR applications, comprising:

[0082] The polygon subdivision module is configured to: represent the target curved boundary scene in the VR application using curved polygons, and subdivide the curved polygons to obtain a set of sub-polygons;

[0083] The latent location construction module is configured to: construct a set of latent locations for the marker by taking the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set as the latent locations of the marker using the polygon intersection set method;

[0084] The marker location solution module is configured to: construct a multiple coverage location problem based on the potential location set, the sub-polygon set, and the given number of markers; take the sub-polygons as the covered points and the potential locations of the markers as the coverage points; and, under the constraint of the number of markers, solve for the optimal set of marker locations with the objective of maximizing the number of covered points.

[0085] Example 3

[0086] One embodiment of the present invention provides a computer program product, including a computer program that, when executed by a processor, implements the method for automatically generating markers for curved boundary scenes in a VR application.

[0087] Example 4

[0088] In one embodiment of the present invention, a non-transitory computer-readable storage medium is provided for storing computer instructions. When the computer instructions are executed by a processor, they implement the method for automatically generating markers for curved boundary scenes in a VR application.

[0089] Example 5

[0090] One embodiment of the present invention provides an electronic device, including: a processor, a memory, and a computer program; wherein, the processor is connected to the memory, and the computer program is stored in the memory. When the electronic device is running, the processor executes the computer program stored in the memory to enable the electronic device to implement the automatic generation method for markers of curved boundary scenes in a VR application.

[0091] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can 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, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0092] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0093] While the specific embodiments of the present invention have been described above in conjunction with the accompanying drawings, this is not intended to limit the scope of protection of the present invention. Those skilled in the art should understand that various modifications or variations that can be made by those skilled in the art without creative effort based on the technical solutions of the present invention are still within the scope of protection of the present invention.

Claims

1. A method for automatically generating markers for curved boundary scenes in VR applications, characterized in that, include: The target curved boundary scene in the VR application is represented by a curved polygon, and the curved polygon is subdivided to obtain a set of sub-polygons; Specifically: The curve polygon is spatially divided using a Voronoi diagram-based partitioning method to obtain several sub-polygons. Each sub-polygon is further subdivided until the radius of the smallest circumcircle of all sub-polygons is less than a given threshold. All the sub-polygons obtained after subdivision form a set of sub-polygons. The subdivision is carried out according to the type of the sub-polygon, and the subdivision method is adopted accordingly; wherein, the type includes type 1 sub-polygon formed by three diagonals, type 2 sub-polygon formed by one diagonal and one curve, type 3 sub-polygon formed by two diagonals and one curve, type 4 sub-polygon formed by one diagonal and two curves, and type 5 sub-polygon formed by two diagonals and two curves. Using the polygon intersection set method, the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set is used as the potential location of the marker, and a potential location set of the marker is constructed. Based on the set of potential locations, the set of sub-polygons, and the given number of markers, a multi-coverage location problem is constructed. The sub-polygons are the covered points, and the potential locations of the markers are the covering points. Under the constraint of the number of markers, the goal is to maximize the number of covered points and find the optimal set of marker locations.

2. The method for automatically generating markers for curved boundary scenes in VR applications as described in claim 1, characterized in that, The subdivision method of the Type 1 sub-polygon is as follows: find the vertex with the largest interior angle, draw a perpendicular point from the vertex to its opposite side, and divide the Type 1 sub-polygon into two Type 1 sub-triangles by the line segment from the vertex to the perpendicular point.

3. The method for automatically generating markers for curved boundary scenes in VR applications as described in claim 1, characterized in that, The subdivision method for the type 2 sub-polygon is as follows: connect the point on the curve that is farthest from the diagonal to the two endpoints of the diagonal to divide the type 2 sub-polygon into a type 1 sub-polygon and a type 2 sub-polygon.

4. The method for automatically generating markers for curved boundary scenes in VR applications as described in claim 1, characterized in that, The subdivision method for the type 3 sub-polygon is as follows: If the curve is convex, connect the two endpoints of the curve to divide the type 3 subpolygon into a type 1 subpolygon and a type 2 subpolygon. If the curve is concave, find the point on the curve that is farthest from the line segment connecting the endpoints of the curve, and draw a parallel line from that point to intersect the line segment, thus dividing the type 3 sub-polygon into one type 1 sub-polygon and two type 3 sub-polygons.

5. The method for automatically generating markers for curved boundary scenes in VR applications as described in claim 1, characterized in that, The subdivision method for the type 4 sub-polygon is as follows: If one curve is convex and the other is concave, find the point on the concave curve that is farthest from the line segment connecting the endpoints of the concave curve, and draw a parallel line from that point that intersects the line segment, thus dividing the type 4 sub-polygon into two type 3 sub-polygons and one type 4 sub-polygon. If both curves are concave, find the point on the concave curve that is farthest from the line segment connecting the endpoints of the concave curve, and draw a parallel line from that point to intersect the line segment, thus dividing the type 4 sub-polygon into two type 3 sub-polygons and one type 4 sub-polygon. If both curves are convex, connect the endpoints of each curve to divide type 4 into two type 2 sub-polygons and one type 1 sub-polygon.

6. The method for automatically generating markers for curved boundary scenes in VR applications as described in claim 1, characterized in that, The subdivision method for the type 5 sub-polygon is as follows: If both curves are convex, connect the endpoints of each curve to divide type 5 into a quadrilateral and two type 2 sub-polygons, which are further divided into two type 1 sub-polygons by connecting one of their diagonals. If both curves are concave, find two parallel lines. If the two parallel lines do not intersect the other curve, the type 5 sub-polygon will be divided into one quadrilateral and four type 3 sub-polygons. If the two parallel lines intersect the other curve, find the common tangent of the two curves and divide the type 5 into four type 3 sub-polygons. If one curve is concave and the other is convex, find a parallel line for the concave curve and connect the endpoints of the convex curve, thereby dividing type 5 into a quadrilateral, a type 2 sub-polygon, and two type 3 sub-polygons. The quadrilateral is further divided into two type 1 sub-polygons by connecting one of its diagonals.

7. The method for automatically generating markers for curved boundary scenes in VR applications as described in claim 1, characterized in that, The coverage boundary of the sub-polygon is calculated as follows: Draw a circle with the given label recognition range as its radius, centered at each vertex of the sub-polygon; The overlapping portion of all circles forms the boundary of the sub-polygon.

8. An automatic marker generation system for curved boundary scenes in VR applications, characterized in that, include: The polygon subdivision module is configured to: represent the target curved boundary scene in a VR application using curved polygons, and subdivide the curved polygons to obtain a set of sub-polygons; specifically: The curve polygon is spatially divided using a Voronoi diagram-based partitioning method to obtain several sub-polygons. Each sub-polygon is further subdivided until the radius of the smallest circumcircle of all sub-polygons is less than a given threshold. All the sub-polygons obtained after subdivision form a set of sub-polygons. The subdivision is carried out according to the type of the sub-polygon, and the subdivision method is adopted accordingly; wherein, the type includes type 1 sub-polygon formed by three diagonals, type 2 sub-polygon formed by one diagonal and one curve, type 3 sub-polygon formed by two diagonals and one curve, type 4 sub-polygon formed by one diagonal and two curves, and type 5 sub-polygon formed by two diagonals and two curves. The latent location construction module is configured to: construct a set of latent locations for the marker by taking the intersection of the covering boundaries of any two sub-polygons in the sub-polygon set as the latent locations of the marker using the polygon intersection set method; The marker location solution module is configured to: construct a multiple coverage location problem based on the potential location set, the sub-polygon set, and the given number of markers; take the sub-polygons as the covered points and the potential locations of the markers as the coverage points; and, under the constraint of the number of markers, solve for the optimal set of marker locations with the objective of maximizing the number of covered points.

Images