Prosecution Insights
Last updated: April 19, 2026
Application No. 18/761,334

3D MODEL PROCESSING SYSTEM AND METHOD AND STORAGE CIRCUIT

Non-Final OA §102§103
Filed
Jul 02, 2024
Examiner
LIU, ZHENGXI
Art Unit
2611
Tech Center
2600 — Communications
Assignee
Viverse Limited
OA Round
1 (Non-Final)
64%
Grant Probability
Moderate
1-2
OA Rounds
3y 4m
To Grant
99%
With Interview

Examiner Intelligence

Grants 64% of resolved cases
64%
Career Allow Rate
225 granted / 354 resolved
+1.6% vs TC avg
Strong +40% interview lift
Without
With
+40.1%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
31 currently pending
Career history
385
Total Applications
across all art units

Statute-Specific Performance

§101
13.2%
-26.8% vs TC avg
§103
61.3%
+21.3% vs TC avg
§102
5.1%
-34.9% vs TC avg
§112
15.7%
-24.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 354 resolved cases

Office Action

§102 §103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Specification The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed. Compact Prosecution With respect to Claim Interpretation, the Examiner has provided some notes regarding “[BRI on the record]” throughout the Office Action, so that the record is clear about the scope of the claimed invention, and the record is also clear about the basis for the Examiner’s analyses. A clear record of the claim interpretation could expedite the examination by creating the condition to allow the examination to focus on Applicant’s inventive concept and its comparison with related prior art. If there are disagreements, Applicant may present an alternative interpretation based on MPEP 2111. The Examiner will adopt Applicant’s interpretation on the record, if Applicant’s interpretation is reasonable and/or arguments are persuasive. Applicant may amend claims relying on the Examiner’s claim interpretation provided on the record. Claim Rejections - 35 USC § 102 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claims 1, 11, and 20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Lin et al. (CN-115713583-A) Regarding Claim 1, Lin discloses A 3D model processing system (“The solution through hierarchical partition division and hierarchical partition three-dimensional model of the three-dimensional scene to generate constructing multi-level detail scene, so as to improve the rendering efficiency of the three-dimensional scene.” Lin Abstract.), comprising: a storage circuit, storing a program code; and a processor, coupled to the storage circuit and accessing the program code to execute (“In a third aspect, the application embodiment provides a computer device, comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor. When the processor executes the computer program, the method for realizing any one of the first aspects is realized.” Lin p. 4. ): obtaining a plurality of nodes of a 3D model ( [BRI on the record] With respect to a “node,” the Examiner is reading it to mean: a building block of a 3D model, e.g., vertex or triangle. This interpretation is in light of the specification, which states, “In one embodiment, a node is a fundamental building block of the 3D model. That is, multiple nodes may form a geometry (e.g., a triangle) and multiple geometries may form the 3D model.” Spec. ¶ 39. “Each node in the tree may contain one or more levels of detail. Based on the tree of nodes and the status of the user device, the client-side logic algorithm is then used to find an optimal tree of nodes to make visible. The algorithm may take into account the user representative object's position and view to determine which nodes need to be visible in order to provide the best visual experience.” Spec. ¶ 78. [Mapping Analysis] Lin teaches its 3D model comprises nodes, stating “S11, reading the three-dimensional scene data. In one implementation, corresponding to the data loading stage, firstly reading the three-dimensional model in the three-dimensional scene into the memory, the texture information and geometric information of the three-dimensional model is analyzed into the corresponding data structure. analyzing the texture information into the matrix ordered according to the size of the resolution, the elements in the matrix comprise the corresponding colour information. geometric information analysis is vertex data, edge index and triangular surface index, wherein the vertex data further comprises a corresponding three-dimensional coordinate position, normal, tangent, UV coordinate, color, bone weight and other information.” Lin p. 9. The obtained nodes are mapped to vertex, edge, and/or triangular surface in the basic model. This mapping is consistent with the specification. Spec. ¶¶ 45-46. Note Lin also uses the term “node,” which does not appear to be used in the same manner as Applicant’s “node.” The Examiner’s BRI is based on Applicant’s specification, because Applicant is his/her own lexicographer.); splitting the 3D model into a first original partition and a second original partition based on a location or a material, wherein the first original partition comprises a first group of nodes and the second original partition comprises a second group of nodes ( [BRI on the record] With respect to “partition,” the Examiner is reading the limitation to mean divide. This interpretation is in light of the specification (¶ 45). With respect to “based on a location or a material,” the Examiner is reading the limitation mean based on an attribute of the first original partition and the second original partition, wherein the attribute is location or material. This interpretation is in light of the specification (¶¶ 45-46) and context of the limitation in the claim. Spec. ¶¶ 45-46 also provides examples for location attributes and material attributes. [0045] Reference is first made to FIG. 3A. In one embodiment, a 3D model may be divided into smaller pieces (i.e., partition) based on a martial of each piece or each region of the 3D model. For example, the original model 310 of a robot may include different parts, for example, head, body, arms, wheels . . . , etc. These parts may be designed to be composed of different materials, such as, metal, plastic, robber . . . , etc. The original model 310 of the robot may be categorized into different materials and be divided into pieces based on the materials (e.g., a material index of each piece) as shown in FIG. 3A. . . . Spec. ¶ 45. [0046] Reference is now made to FIG. 3B. In one embodiment, a 3D model may be divided into smaller pieces based on a location of each piece of the 3D model. For example, the original model 310 of the robot may include an upper part, a lower, a left part, a right part, a front part, a rear part . . . , etc. The original model 310 of the robot may be categorized into different locations or quadrants in space and be divided into pieces based on the locations as shown in FIG. 3B. That is, partitions close to each other may be grouped together. . . . Spec. ¶ 46. [Mapping Analysis] Lin teaches splitting a model into a hierarchical partitions, stating “In a first aspect, the application embodiment provides a three-dimensional scene comprehensive method, comprising: using three-dimensional scene data to construct multi-level detail model, the multi-level detail model comprises three-dimensional scene data of different fine degree. dividing the space range of the three-dimensional scene data into a hierarchical partition, obtaining the hierarchical partition information, the hierarchical partition information comprises partition information of each layer, the spatial range of each layer is divided into corresponding number of partitions, the partition of the next level is obtained by dividing the partition of the upper level into the partition of the partition, The fine degree of the partition of the last level is lower than the fine degree of the partition of the next level. generating a hierarchical partition three-dimensional model according to the multi-level detail model and the hierarchical partition information; the hierarchical partition three-dimensional model is used for generating multi-level detail scene.” Lin p. 2. The first original partition (e.g., Fig. 3 B1) and second original partition (e.g., Fig. 3 B2) are mapped to partitions of any level, except for the root level or the leaf level, because a) the root level only has one partition, and the leaf level is not further partitioned. Lin teaches splitting based on location, stating “FIG. 3 is a schematic diagram of a hierarchical partition of a three-dimensional scene. As shown in FIG. 3, A1 represents the first level of the whole three-dimensional scene, representing the first level only the one partition. B1 ~ B4 is further divided on the basis of A1, representing the second level has 4 partitions. by parity of reasoning, can be continuously divided according to different requirements, here is only an example, and is not limited.” Lin p. 7. Lin further discloses, “using the method of combining non-limiting quadtree and hierarchical bounding box, dividing the three-dimensional scene into a plurality of hierarchical partitions, the spatial range of each layer is divided into a plurality of partitions, and the total space range of each layer is the same as the scene space range, . . ..” Lin p. 17. PNG media_image1.png 374 268 media_image1.png Greyscale Lin teaches its 3D model comprises nodes, stating “S11, reading the three-dimensional scene data. In one implementation, corresponding to the data loading stage, firstly reading the three-dimensional model in the three-dimensional scene into the memory, the texture information and geometric information of the three-dimensional model is analyzed into the corresponding data structure. analyzing the texture information into the matrix ordered according to the size of the resolution, the elements in the matrix comprise the corresponding colour information. geometric information analysis is vertex data, edge index and triangular surface index, wherein the vertex data further comprises a corresponding three-dimensional coordinate position, normal, tangent, UV coordinate, color, bone weight and other information.” Lin pp. 8-9. The nodes are mapped to vertex, edge, and/or triangular surface in the basic model. This mapping is consistent with the specification. Spec. ¶¶ 45-46. Note Lin also uses the term “node,” which does not appear to be used in the same manner as Applicant’s “node.” The Examiner’s BRI is based on Applicant’s specification, because Applicant is his/her own lexicographer. The first group of nodes are mapped to the vertex, edge, and/or triangular surface in the basic model included in the first original partition. The second group of nodes are mapped to the vertex, edge, and/or triangular surface in the basic model included in the second original partition.); generating a plurality of first graded partitions (e.g., F3. B1 and sub-partitions under F3. B1.) of different levels of detail for the first original partition (e.g., F3. B1) based on the first group of nodes ( [BRI on the record] With respect to “graded partitions of different levels of detail,” the Examiner is reading the limitation to be: partitions are graded based on each partition’s level of detail. This interpretation is made in light of the specification. [0055] To sum up, the original model 310 may include a plurality of partitions (e.g., the original partitions 320 or the original partitions 330) and each partition may be processed to include different amounts of triangles for different displaying situations to provide the optimal visual experience. That is, each partition may be processed to generate a plurality of graded partitions for displaying individually. Each of the graded partitions may belong to a level of partitioning. That is, each partition of the original model 310 may belong to different levels of partitioning of the graded partitions. [0056] In one embodiment, the each partition may include 3 levels of partitioning, such as level 0, level 1, and level 2. A level of partitioning may define that how many parts or groups that a 3D model or a partition of a 3D model may be divided into, while the higher level of partitioning stands for more groups. That is, while a level of partitioning is higher, more groups of triangles may be included in a partition of the original model 310. . . . Spec. ¶¶ 55-56. [Mapping Analysis] Lin teaches graded partitions of different levels of detail, stating “The application is suitable for three-dimensional model field, providing a three-dimensional scene comprehensive method, comprising: constructing multi-level detail model by three-dimensional scene data, the multi-level detail model comprises three-dimensional scene data of different fine degrees; dividing the space range of the three-dimensional scene data into a hierarchical partition, obtaining the hierarchical partition information, the hierarchical partition information comprises partition information of each layer, the spatial range of each layer is divided into corresponding number of partitions, the partition of the next level is obtained by dividing the partition of the upper level into the partition of the partition, the fine degree of the sub-area of the previous layer is lower than the fine degree of the sub-area of the next layer; generating a hierarchical partition three-dimensional model according to the multi-level detail model and the hierarchical partition information; the hierarchical partition three-dimensional model is used for generating multi-level detail scene. The solution through hierarchical partition division and hierarchical partition three-dimensional model of the three-dimensional scene to generate constructing multi-level detail scene, so as to improve the rendering efficiency of the three-dimensional scene.” Lin Abstract. The first graded partitions are mapped to partitions of the first original partition and its sub-partitions under different lower hierarchical levels. For example, it could be F3. B1 and sub-partitions under F3. B1. The graded partitions are based on the first group of nodes, mapped to the vertex, edge, and/or triangular surface in the basic model included in the first original partition. Lin teaches generating different level-of-detail model based on the basic model, which includes the first group of nodes, “wherein the generation of each level detail model is independent from each other, the optimization three-dimensional model is used for simplifying the basic model, the geometric information is simplified, the texture information is simplified and the model description parameter record is simplified.” Lin S14. Lin teaches the level-of-detail models matches the graded partition levels, stating “generating unit 1003, used for according to the multi-level detail model and hierarchical partition information to generate hierarchical partition three-dimensional model, hierarchical partition three-dimensional model for generating multi-level detail scene. each hierarchical partition has a three-dimensional model matched with the spatial range thereof, the three-dimensional model of the same hierarchical partition has a relatively close fine degree, the fine degree of the three-dimensional model of different hierarchical partitions is gradually reduced from bottom to top. according to the hierarchical partition relation, generating three-dimensional model of each partition layer by layer from bottom to top.”); and generating a plurality of second graded partitions (e.g., F3. B2 and sub-partitions under F3. B2.) of different levels of detail (Lin Abstract) for the second original partition (e.g., F3. B2) based on the second group of nodes (the vertex, edge, and/or triangular surface in the basic model included in the second original partition) ( The second graded partitions are mapped to partitions of the second original partition and its sub-partitions under different lower hierarchical levels. For example, it could be F3. B2 and sub-partitions under F3. B2. The analysis for this limitation is similar to “generating a plurality of first graded partitions of different levels of detail for the first original partition based on the first group of nodes.”). Claim 11 and Claim 20 are substantially similar to Claim 1. The rejection analyses based on Lin for Claim 1 are applied to Claim 11 and Claim 20 as well. In addition, Claim 11 recites “A 3D model processing method . . .” (“The solution through hierarchical partition division and hierarchical partition three-dimensional model of the three-dimensional scene to generate constructing multi-level detail scene, so as to improve the rendering efficiency of the three-dimensional scene.” Lin Abstract.) and Claim 20 recites “A non-transitory storage circuit, storing a program code and the program code is configured to cause a processor to execute . . .” (“In a third aspect, the application embodiment provides a computer device, comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor. When the processor executes the computer program, the method for realizing any one of the first aspects is realized.” Lin p. 4). Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 2-6, 8, 10, 12-16, and 18 are rejected under 35 U.S.C. 103 as being unpatentable over Lin as applied to Claim 1, in further view of Shimizu (WO 2023281803 A1). Regarding Claim 2, Lin further teaches The 3D model processing system according to claim 1, wherein the processor further executes (“In a third aspect, the application embodiment provides a computer device, comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor. When the processor executes the computer program, the method for realizing any one of the first aspects is realized.” Lin p. 4.): determining a first level of detail for the plurality of first graded partitions based on a status of a rendering viewpoint rendering viewpoint “In actual rendering, the more the distance from the viewpoint position and/or the larger the view field range, loading the coarser detail model, the smaller the amount of data required to be loaded and rendered, the higher the rendering efficiency. Here, the relatively rough detail model can be seen as one example of the model to be rendered. Therefore, the different multi-level detail models can be switched according to the distance between the model and the viewpoint so as to improve the rendering efficiency.” Lin. p. 2. “The index can describe the spatial range and three-dimensional model information of each hierarchical partition, which can be used for three-dimensional model loading scheduling based on viewpoint, so as to avoid the pre-loading of the three-dimensional scene data.” Lin. p. 16. Here, the level of detail is determined based on the distance between the 3D model and the viewpoint. The distance is mapped to the status of the rendering point. The same determining process is applied for both original partitions of a same level, e.g., Lin F3. B1-2, and their sub-partitions.); providing one of the plurality of first graded partitions to the user device based on the first level of detail; and providing one of the plurality of second graded partitions to the user device based on the second level of detail (“In actual rendering, the more the distance from the viewpoint position and/or the larger the view field range, loading the coarser detail model, the smaller the amount of data required to be loaded and rendered, the higher the rendering efficiency. Here, the relatively rough detail model can be seen as one example of the model to be rendered. Therefore, the different multi-level detail models can be switched according to the distance between the model and the viewpoint so as to improve the rendering efficiency.” Lin. p. 2. The same providing process is applied for both original partitions of a same level, e.g., Lin F3. B1-2, and their sub-partitions.). However, Lin does not explicitly disclose determining a request of viewing the 3D model, a status of a user device comprises the status of the rendering viewpoint. Shimizu teaches determining a request of viewing the 3D model ( “The display unit 430 displays an image in the virtual space from the first-person viewpoint based on the eyes of the avatar. Note that the first-person viewpoint image based on the avatar's eyes is generated based on sensor data acquired by the orientation sensor mounted on the HMD 40.” Shimizu p. 5. Here, HMD requests and displays viewing of a model of virtual space, including Lin’s 3D models, based on sensor data.), and a status of a user device comprises the status of the rendering viewpoint (“The HMD 40 is an example of an information processing device, and is a terminal used by a user who views live video and live audio in virtual space. The HMD 40 is, for example, a head-mounted display to which applications such as VR (Virtual Reality) or AR (Augmented Reality) are applied. A user wearing the HMD 40 can use an input device such as a hand controller to move the avatar, which is the alter ego of the user, in the virtual space. Also, the user wearing the HMD 40 can view the live video from the first-person viewpoint based on the eyes of the avatar from the display of the HMD 40.” Shimizu. p. 3. The user device is mapped to HMD.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Shimizu’s virtual reality setup with primary reference Lin. One of ordinary skill in the art would be motivated to for entertainment, e.g., VR gaming. “VR (Virtual Reality) applications, which have become popular in recent years, allow users to view a virtual space in which a 3D model is placed from any viewpoint. Such a VR world can be provided mainly using a non-transmissive HMD (Head Mounted Display) that covers the user's field of vision with a display unit.” Shimizu. p. 1. Regarding Claim 3, Lin in view of Shimizu teaches The 3D model processing system according to claim 2, wherein the status of the user device comprises a distance between a user representative object and the 3D model, an eye sight of a user, an eye gaze of the user, a connection speed of the user device, or a computing power of the user device ( [BRI on the record] With respect to “a user representative object,” the Examiner is reading the limitation to include avatar. [0070] . . . The queries may be optimized based on different factors, such as a position of the user representative object of the user in the 3D space (e.g., the virtual world of XR) and a distance between the user representative object and the 3D model. It is worth mentioned that, the user representative object may be, for example, an avatar of the user, a virtual object to represent the user, a virtual object to represent a head-mounted display (HMD) device worn by the user, or other similar objects. Spec. ¶ 70. [Mapping Analysis] Therefore, the different multi-level detail models can be switched according to the distance between the model and the viewpoint so as to improve the rendering efficiency.” Lin. p. 2. “A user wearing the HMD 40 can use an input device such as a hand controller to move the avatar, which is the alter ego of the user, in the virtual space. Also, the user wearing the HMD 40 can view the live video from the first-person viewpoint based on the eyes of the avatar from the display of the HMD 40.” Shimizu p. 3.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Shimizu’s virtual reality setup with primary reference Lin. One of ordinary skill in the art would be motivated to for entertainment, e.g., VR gaming. “VR (Virtual Reality) applications, which have become popular in recent years, allow users to view a virtual space in which a 3D model is placed from any viewpoint. Such a VR world can be provided mainly using a non-transmissive HMD (Head Mounted Display) that covers the user's field of vision with a display unit.” Shimizu. p. 1. Regarding Claim 4, Lin in view of Shimizu teaches The 3D model processing system according to claim 2, wherein the processor further executes: in response to a distance between a user representative object and the 3D model getting smaller, upgrade the first level of detail or the second level of detail to provide more details of the 3D model ( “when the actual rendering, switching the hierarchical partition three-dimensional model of different fine degrees according to the distance of the model and the viewpoint, the farther the viewpoint distance, loading the coarser three-dimensional model, reducing the loading and rendering data amount, so as to improve the rendering efficiency of the three-dimensional scene when the data quantity is large.” Lin. p. 6. A user wearing the HMD 40 can use an input device such as a hand controller to move the avatar, which is the alter ego of the user, in the virtual space. Also, the user wearing the HMD 40 can view the live video from the first-person viewpoint based on the eyes of the avatar from the display of the HMD 40.” Shimizu p.1.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Shimizu’s virtual reality setup with primary reference Lin. One of ordinary skill in the art would be motivated to for entertainment, e.g., VR gaming. “VR (Virtual Reality) applications, which have become popular in recent years, allow users to view a virtual space in which a 3D model is placed from any viewpoint. Such a VR world can be provided mainly using a non-transmissive HMD (Head Mounted Display) that covers the user's field of vision with a display unit.” Shimizu. p. 1. Regarding Claim 5, Lin in view of Shimizu teaches The 3D model processing system according to claim 2, wherein the processor further executes: in response to a distance between a user representative object and the 3D model getting greater, downgrade the first level of detail or the second level of detail to provide less details of the 3D model ( “when the actual rendering, switching the hierarchical partition three-dimensional model of different fine degrees according to the distance of the model and the viewpoint, the farther the viewpoint distance, loading the coarser three-dimensional model, reducing the loading and rendering data amount, so as to improve the rendering efficiency of the three-dimensional scene when the data quantity is large.” Lin. p. 6. A user wearing the HMD 40 can use an input device such as a hand controller to move the avatar, which is the alter ego of the user, in the virtual space. Also, the user wearing the HMD 40 can view the live video from the first-person viewpoint based on the eyes of the avatar from the display of the HMD 40.” Shimizu p. 1.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Shimizu’s virtual reality setup with primary reference Lin. One of ordinary skill in the art would be motivated to for entertainment, e.g., VR gaming. “VR (Virtual Reality) applications, which have become popular in recent years, allow users to view a virtual space in which a 3D model is placed from any viewpoint. Such a VR world can be provided mainly using a non-transmissive HMD (Head Mounted Display) that covers the user's field of vision with a display unit.” Shimizu. p. 1. Regarding Claim 6, Lin in view of Shimizu teaches The 3D model processing system according to claim 1, wherein the processor further executes: determining a request of viewing the 3D model ( “The display unit 430 displays an image in the virtual space from the first-person viewpoint based on the eyes of the avatar. Note that the first-person viewpoint image based on the avatar's eyes is generated based on sensor data acquired by the orientation sensor mounted on the HMD 40.” Shimizu p. 5. Here, HMD requests and displays viewing of a model of virtual space, including Lin’s 3D models, based on sensor data.); determining a lowest level of details as a first level of detail for the plurality of first graded partitions ( Lin teaches splitting a model into a hierarchical partitions, stating “In a first aspect, the application embodiment provides a three-dimensional scene comprehensive method, comprising: using three-dimensional scene data to construct multi-level detail model, the multi-level detail model comprises three-dimensional scene data of different fine degree. dividing the space range of the three-dimensional scene data into a hierarchical partition, obtaining the hierarchical partition information, the hierarchical partition information comprises partition information of each layer, the spatial range of each layer is divided into corresponding number of partitions, the partition of the next level is obtained by dividing the partition of the upper level into the partition of the partition, The fine degree of the partition of the last level is lower than the fine degree of the partition of the next level. generating a hierarchical partition three-dimensional model according to the multi-level detail model and the hierarchical partition information; the hierarchical partition three-dimensional model is used for generating multi-level detail scene.” Lin p. 2. The first original partition (e.g., Fig. 3 B1) and second original partition (e.g., Fig. 3 B2) are mapped to partitions of any level, except for the root level or the leaf level, because the root level only has one partition, and the leaf level is not further partitioned. Lin teaches graded partitions of different levels of detail, stating “The application is suitable for three-dimensional model field, providing a three-dimensional scene comprehensive method, comprising: constructing multi-level detail model by three-dimensional scene data, the multi-level detail model comprises three-dimensional scene data of different fine degrees; dividing the space range of the three-dimensional scene data into a hierarchical partition, obtaining the hierarchical partition information, the hierarchical partition information comprises partition information of each layer, the spatial range of each layer is divided into corresponding number of partitions, the partition of the next level is obtained by dividing the partition of the upper level into the partition of the partition, the fine degree of the sub-area of the previous layer is lower than the fine degree of the sub-area of the next layer; generating a hierarchical partition three-dimensional model according to the multi-level detail model and the hierarchical partition information; the hierarchical partition three-dimensional model is used for generating multi-level detail scene. The solution through hierarchical partition division and hierarchical partition three-dimensional model of the three-dimensional scene to generate constructing multi-level detail scene, so as to improve the rendering efficiency of the three-dimensional scene.” Lin Abstract. The first graded partitions are mapped to partitions of the first original partition and its sub-partitions under different lower hierarchical levels. For example, it could be F3. B1 and sub-partitions under F3. B1 and corresponds to first level of detail. In this example, a lowest level of details corresponds to the detail level associated with Lin F3. B1.); determining the lowest level of details as a second level of detail for the plurality of second graded partition ( The second graded partitions are mapped to partitions of the second original partition and its sub-partitions under different lower hierarchical levels. For example, it could be F3. B2 and sub-partitions under F3. B2. In this example, a lowest level of details corresponds to the detail level associated with Lin F3. B2 and corresponds to second level of detail.); providing one of the plurality of first graded partitions to a user device based on the first level of detail ( “In actual rendering, the more the distance from the viewpoint position and/or the larger the view field range, loading the coarser detail model, the smaller the amount of data required to be loaded and rendered, the higher the rendering efficiency. Here, the relatively rough detail model can be seen as one example of the model to be rendered. Therefore, the different multi-level detail models can be switched according to the distance between the model and the viewpoint so as to improve the rendering efficiency.” Lin. p. 2. “The index can describe the spatial range and three-dimensional model information of each hierarchical partition, which can be used for three-dimensional model loading scheduling based on viewpoint, so as to avoid the pre-loading of the three-dimensional scene data.” Lin p. 16. “The HMD 40 is an example of an information processing device, and is a terminal used by a user who views live video and live audio in virtual space. The HMD 40 is, for example, a head-mounted display to which applications such as VR (Virtual Reality) or AR (Augmented Reality) are applied. A user wearing the HMD 40 can use an input device such as a hand controller to move the avatar, which is the alter ego of the user, in the virtual space. Also, the user wearing the HMD 40 can view the live video from the first-person viewpoint based on the eyes of the avatar from the display of the HMD 40.” Shimizu p. 1.); and providing one of the plurality of second graded partitions to the user device based on the second level of detail ( The second graded partitions are mapped to partitions of the second original partition and its sub-partitions under different lower hierarchical levels. For example, it could be F3. B2 and sub-partitions under F3. B2. The analysis for this limitation is similar to “providing one of the plurality of first graded partitions to a user device based on the first level of detail.”). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Shimizu’s virtual reality setup with primary reference Lin. One of ordinary skill in the art would be motivated to for entertainment, e.g., VR gaming. “VR (Virtual Reality) applications, which have become popular in recent years, allow users to view a virtual space in which a 3D model is placed from any viewpoint. Such a VR world can be provided mainly using a non-transmissive HMD (Head Mounted Display) that covers the user's field of vision with a display unit.” Shimizu. p. 1. Regarding Claim 8, Lin in view of Shimizu teaches The 3D model processing system according to claim 1, wherein the first original partition belongs to a first location and the second original partition belongs to a second location (“using the method of combining non-limiting quadtree and hierarchical bounding box, dividing the three-dimensional scene into a plurality of hierarchical partitions, the spatial range of each layer is divided into a plurality of partitions, and the total space range of each layer is the same as the scene space range, the coarsely hierarchical partition is divided into a plurality of sub-partitions at the adjacent fine hierarchical level, until the most fine hierarchical partition is the spatial range of the original single three-dimensional model. the space range of each layer is divided into the corresponding number of partitions, the partition of the next level is obtained by further dividing the partition of the upper level of the partition.” Lin p. 17.). Regarding Claim 10, Lin in view of Shimizu teaches The 3D model processing system according to claim 1, wherein the processor further executes: performing a flattening process to removing all hierarchies in the 3D model ( “The three-dimensional scene rendering is the process of generating the two-dimensional image from the digital three-dimensional scene by using the computer, mainly through organizing the pattern, managing and displaying to realize the reproduction of the three-dimensional real image.” Lin. p. 2. When a 3D model is rendered/flattened into 2D, all hierarchies in the 3D model are removed.). Claims 12-16 and 18 are substantially similar to Claims 2-6 and 8. The rejection analyses based on Lin in view of Shimizu for Claims 2-6 and 8 are applied to Claims 12-16 and 18. Claims 7 and 17 are rejected under 35 U.S.C. 103 as being unpatentable over Lin as applied to Claim 1, in further view of Poursohi et al. (US 8451323 B1). Regarding Claim 7, Lin teaches The 3D model processing system according to claim 1. Lin does not explicitly disclose wherein the first original partition belongs to a first material and the second original partition belongs to a second material. Poursohi teaches wherein the first original partition belongs to a first material and the second original partition belongs to a second material ( “In some embodiments, the stored 3D-data model (e.g., the associated mesh model) may be segmented (into multiple mesh models) along material-type boundaries, to facilitate later utilizing (e.g., rendering) the stored 3D-data model; in some instances, this segmentation may mean that what might, but for material type, be considered a single surface (e.g., face) of a data-modeled object may be subdivided by material type.” Poursohi ¶ 37. “For example, a user could enter a search for objects where the color equals red and the material type equals leather. Further, a similar approach could be used with one or more other properties of data-modeled objects, such as translucence, brightness, reflectivity, and/or luminescence, to name but a few examples.” Poursohi ¶ 34. After Lin and Poursohi are combined, the first original partition and the second original partition are made based on Poursohi’s material type.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Poursohi’s segmenting/partitioning a model based on material type with primary reference Lin. One of ordinary skill in the art would be motivated to allow the flexibility of selecting information based on material type. “For example, a user could enter a search for objects where the color equals red and the material type equals leather. Further, a similar approach could be used with one or more other properties of data-modeled objects, such as translucence, brightness, reflectivity, and/or luminescence, to name but a few examples.” Poursohi ¶ 34. Claim 17 is substantially similar to Claim 7. The rejection analyses based on Lin in view of Poursohi for Claim 7 is applied to Claim 17. Claims 9 and 19 are rejected under 35 U.S.C. 103 as being unpatentable over Lin as applied to Claim 1, in further view of Liu et al. (US 20180330480 A1). Regarding Claim 9, Lin discloses The 3D model processing system according to claim 1. Lin does not explicitly disclose wherein the processor further executes: unwrapping the 3D model into a texture map; baking out a baked texture by transferring a high-resolution model of a texture of the 3D model to a low-resolution model; and applying the baked texture to a mesh of the 3D model. Liu teaches wherein the processor further executes: unwrapping the 3D model into a texture map (“For example, at 2020, the reduced 3D model is UV unwrapped to allow textures of the high-poly 3D model to be baked into the surface.” Liu ¶ 168. ); baking out a baked texture by transferring a high-resolution model of a texture of the 3D model to a low-resolution model ( “For example, at 2020, the reduced 3D model is UV unwrapped to allow textures of the high-poly 3D model to be baked into the surface.” Liu ¶ 168. The low-resolution model is mapped to the reduced 3D model. The high-resolution model is mapped to the high-poly 3D model. ); and applying the baked texture to a mesh of the 3D model ( “After mesh reduction, texture mapping may be employed to add details from the high-poly model back into the low-poly model without a significant increase to the polygon count. Preferably, the end result is that the low-poly model looks indistinguishable from its high-poly model counterpart. In this way, the retopology process may be viewed as an optimization process since the objective is to make the low-poly model look as close to the high-poly model counterpart while reducing the polygon count to a specific target.” Liu ¶ 147.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine Liu’s texturing method with Lin. One of ordinary skill in the art would be motivated to maintain relative high quality appearance while reducing computation. “After mesh reduction, texture mapping may be employed to add details from the high-poly model back into the low-poly model without a significant increase to the polygon count. Preferably, the end result is that the low-poly model looks indistinguishable from its high-poly model counterpart. In this way, the retopology process may be viewed as an optimization process since the objective is to make the low-poly model look as close to the high-poly model counterpart while reducing the polygon count to a specific target.” Liu ¶ 147. Claim 19 is substantially similar to Claim 9. The rejection analyses based on Lin in view of Poursohi for Claim 9 is applied to Claim 19. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ZHENGXI LIU whose telephone number is (571)270-7509. The examiner can normally be reached M-F 9 AM - 5 PM. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kee Tung can be reached at (571)272-7794. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /ZHENGXI LIU/Primary Examiner, Art Unit 2611
Read full office action

Prosecution Timeline

Jul 02, 2024
Application Filed
Jan 02, 2026
Non-Final Rejection — §102, §103
Mar 31, 2026
Response Filed

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602865
METHODS FOR DEPTH CONFLICT MITIGATION IN A THREE-DIMENSIONAL ENVIRONMENT
2y 5m to grant Granted Apr 14, 2026
Patent 12599463
COLOR MANAGEMENT PROCESS FOR CUSTOMIZED DENTAL RESTORATIONS
2y 5m to grant Granted Apr 14, 2026
Patent 12597402
INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND PROGRAM FOR APPLICATION WINDOW HAVING FIRST DISPLAY MODE AND SECOND DISPLAY MODE
2y 5m to grant Granted Apr 07, 2026
Patent 12567193
PARTICLE RENDERING METHOD AND APPARATUS
2y 5m to grant Granted Mar 03, 2026
Patent 12561929
METHOD AND ELECTRONIC DEVICE FOR PROVIDING INFORMATION RELATED TO PLACING OBJECT IN SPACE
2y 5m to grant Granted Feb 24, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
64%
Grant Probability
99%
With Interview (+40.1%)
3y 4m
Median Time to Grant
Low
PTA Risk
Based on 354 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month