Prosecution Insights
Last updated: October 02, 2026
Application No. 19/037,780

STORAGE MEDIUM, INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING APPARATUS AND INFORMATION PROCESSING METHOD

Non-Final OA §103
Filed
Jan 27, 2025
Priority
Jan 30, 2024 — JP 2024-011591
Examiner
HE, WEIMING
Art Unit
Tech Center
Assignee
Nintendo Co., Ltd.
OA Round
1 (Non-Final)
46%
Grant Probability
Moderate
1-2
OA Rounds
1y 8m
Est. Remaining
58%
With Interview

Examiner Intelligence

Grants 46% of resolved cases
46%
Career Allowance Rate
196 granted / 423 resolved
-13.7% vs TC avg
Moderate +12% lift
Without
With
+11.9%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
26 currently pending
Career history
456
Total Applications
across all art units

Statute-Specific Performance

§101
8.0%
-32.0% vs TC avg
§103
62.1%
+22.1% vs TC avg
§102
10.8%
-29.2% vs TC avg
§112
15.0%
-25.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 423 resolved cases

Office Action

§103
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 . Priority Acknowledgment is made of applicant’s claim for foreign priority based on an application filed in Japan on Jan. 30, 2024. Information Disclosure Statement The information disclosure statement (IDS) submitted on 1/27/25, 9/24/25, 10/29/25 and 11/16/26 are being considered by the examiner. 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. Claim Rejections - 35 USC § 103 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 1-18 are rejected under 35 U.S.C. 103 as being unpatentable over Liu et al. (CN 115700779A) in view of Gopalakrishnan et al. (US 2021/0406434 A1). As to Claim 1, Liu teaches One or more non-transitory computer-readable storage medium having stored therein instructions that, when executed, cause one or more processors of an information processing apparatus to execute information processing comprising: generating particle data including data representing positions of a plurality of particles that correspond to a shape of an existing object, which is an object arranged in a virtual space (Liu discloses “The method includes: generating a target model located in a virtual scene and a particle model corresponding to the target model; wherein the particle model and the target model are set overlapping in the virtual scene; the particle model includes multiple particles connected by virtual springs; the shape formed by the multiple particles matches the shape of the target model… determining the first position of the particles in the particle model…” in [0004]); generating voxel data related to a voxel object, which has a shape corresponding to the positions of the plurality of particles, based on the particle data (Liu discloses “In this scheme, the virtual model is divided into finite element units to obtain a set of tetrahedral or hexahedral voxels… a virtual model is usually divided into a large number of voxels” in [0029]; “the shape formed by the multiple particles matches the shape of the target model” in [0032]); generating a mesh for the voxel object based on the voxel data; and generating an image that is obtained by rendering the mesh in the virtual space so as to output the generated image to a display device (Liu discloses “the number of particles in the particle model is less than the number of mesh vertices in the target model; there is a preset mapping relationship between the particles and the mesh vertices… determining the first rendering parameters of the mesh vertices in the target model based on the first position of the particles in the particle model and the mapping relationship between the particles and the mesh vertices; and rendering the mesh vertices in the target model using the first rendering parameters to obtain the deformed target model” in [0004].) Liu doesn’t directly teach calculating change over time. The combination of Gopalakrishnan further teaches following limitations: calculating change over time of the positions of the plurality of particles and updating the particle data based on the calculation result (Liu discloses “In response to a collision event detected by the particle model, the first position of the particles in the particle model after the collision event is determined based on the collision parameters of the collision event and the deformation threshold of the virtual springs” in [0017]; “This technology can be applied to game scenes or other types of virtual scenes, particularly to the deformation control of virtual models, and especially to real-time deformation rendering of virtual models” in [0030]; “In the above embodiments, the mass module uses a plastic spring mass model to simulate the deformation of the vehicle model, thereby efficiently updating the rendering parameters of the model vertices and updating the shape of the rendered model in the VertexShader” in [0090]. Gopalakrishnan further discloses “In a LBM-based physical process simulation system, fluid flow is represented by distribution function values, evaluated at a set of discrete velocities using the well-known lattice Boltzmann equation (see Eq. 1 below) that describes the time-evolution of the distribution function” in [0034], see also [0035, 0052].) It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine the invention of Liu with the teaching of Gopalakrishnan so as to simulate elements of a fluid flow including a simulation of evolution of particle distribution (Gopalakrishnan, [0052]). As to Claim 2, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the existing object is an object generated based on voxel data that is generated before the particle data related to the existing object is generated (Liu discloses “The method includes: generating a target model located in a virtual scene and a particle model corresponding to the target model” in [0004]; “a virtual model is usually divided into a large number of voxels” in [0029]. Here, since the particle model is generated to correspond to the target model, it is obvious that the target model is generated before the particle model.) As to Claim 3, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the particle data is generated based on whether or not at least a part of the existing object is present in each of a plurality of unit regions that are obtained by partitioning a region including the existing object in the virtual space into a grid (Liu discloses “The method includes: generating a target model located in a virtual scene and a particle model corresponding to the target model” in [0004]; “a virtual model is usually divided into a large number of voxels” in [0029]; “Specifically, a specified number of target particles can be determined from around the grid vertices. The target particle is used to establish a local coordinate system, through which the relative relationship between the grid vertices and the target particle is determined” in [0066], see also [0068, 0079].) As to Claim 4, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 3, wherein a length of one side of the unit region is equal to a length of one side of a voxel corresponding to the voxel data generated based on the particle data (Liu discloses “there is a preset mapping relationship between the particles and the mesh vertices” in [0004]; “a virtual model is usually divided into a large number of voxels” in [0029]. It is obvious that the size of the virtual object is calculated based on the number of voxel along all directions.) As to Claim 5, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the particle data is updated so that at least some of the plurality of particles disappear in response to satisfaction of a disappearance condition (Gopalakrishnan discloses “Surface dynamics involves converting the set of incoming distribution functions to the set of outgoing distribution functions (corresponding to those particles reflected from the boundary surface) satisfying specific boundary conditions on mass and momentum fluxes through the boundary” in [0007]; “Lattice Boltzmann Model simulation includes the simulation 46 of evolution of particle distribution that includes the surface dynamics conversion, boundary modeling, and advection of particles to a next cell in the LBM mesh” in [0052].) As to Claim 6, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein: the particle data is updated repeatedly; and a value of the current particle data is calculated, which represents new positions of the plurality of particles, by using the previously updated particle data, without using the voxel data generated based on the previously updated particle data (Gopalakrishnan discloses “During each time increment of the simulation, movement of particles from voxel to voxel is simulated by an advection stage (278-286) that accounts for interactions of the particles with surface facets. Next, a collision stage (288) simulates the interaction of particles within each voxel...If the incremented timer does not indicate that the simulation is complete (294), the advection and collision stages (278-200) are repeated. If the incremented timer indicates that the simulation is complete (202), results of the simulation are stored and/or displayed (204)” in [0102].) As to Claim 7, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the information processing further comprises: updating a range of a voxel space, in which voxels related to the voxel data generated based on the particle data are set, based on the updated particle data (Gopalakrishnan discloses “Voxels that interact with one or more facets by transferring particles to the facet or receiving particles from the facet are also identified as voxels affected by the facets. All voxels that are intersected by a facet will include at least one state that receives particles from the facet and at least one state that transfers particles to the facet. In most cases, additional voxels also will include such states” in [0095], see also particles are moved between voxels in [0125].) As to Claim 8, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the positions of the plurality of particles are controlled so that the particles are located within a voxel space, in which voxels related to the voxel data generated based on the particle data are set (Gopalakrishnan discloses “Referring again to FIG. 7, particles are moved between voxels along the three-dimensional rectilinear lattice (284). This voxel to voxel movement is the only movement operation performed on voxels that do not interact with the facets (i.e., voxels that are not located near a surface). In typical simulations, voxels that are not located near enough to a surface to interact with the surface constitute a large majority of the voxels” in [0125].) As to Claim 9, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the particle data corresponding to the existing object is generated in response to the existing object contacting a first object different from the existing object (Gopalakrishnan discloses section of “gather from voxels to facets, move from facet to facet, perform facet surface dynamics and scatter from facets to voxels” in [0106-0132].) As to Claim 10, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 9, wherein the particle data corresponding to the existing object is generated at least on a condition that a material set for the existing object and a material set for the first object are in a predetermined combination (Gopalakrishnan discloses “Voxels may be affected by facets in a number of ways. First, a voxel that is intersected by one or more facets is affected in that the voxel has a reduced volume relative to non-intersected voxels. This occurs because a facet, and material underlying the surface represented by the facet, occupies a portion of the voxel” in [0094], see also [0129].) As to Claim 11, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the information processing further comprises: determining whether or not the particles have contacted a second object different from the voxel object or whether or not the voxel object has contacted the second object; and if it is determined that the particles have contacted the second object or if it is determined that the voxel object has contacted the second object, causing a portion of the second object that has been contacted to disappear from the virtual space (Gopalakrishnan discloses “The move operation becomes slightly more complicated for voxels that interact with one or more surfaces. This can result in one or more fractional particles being transferred to a facet. Transfer of such fractional particles to a facet results in fractional particles remaining in the voxels. These fractional particles are transferred to a voxel occupied by the facet.” in [0128], see also [0129].) As to Claim 12, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 11, wherein the contacted portion of the second object disappears from the virtual space at least on a condition that a material set for the voxel object or the existing object and a material set for the second object are in a predetermined combination (Gopalakrishnan discloses PNG media_image1.png 721 852 media_image1.png Greyscale ). As to Claim 13, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 1, wherein the particle data is updated so that the plurality of particles move over time toward destination positions that are set respectively for the plurality of particles (Gopalakrishnan discloses “Referring again to FIG. 7, particles are moved between voxels along the three-dimensional rectilinear lattice (284). This voxel to voxel movement is the only movement operation performed on voxels that do not interact with the facets (i.e., voxels that are not located near a surface). In typical simulations, voxels that are not located near enough to a surface to interact with the surface constitute a large majority of the voxels” in [0125]; “For voxels that do not interact with a surface, the move operation is computationally quite simple. The entire population of a state is moved from its current voxel to its destination voxel during every time increment. At the same time, the particles of the destination voxel are moved from that voxel to their own destination voxels” in [0127].) As to Claim 14, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 13, wherein: the information processing apparatus stores data representing target positions of the plurality of particles, which are positions of the particles after change over time; and the destination positions are set based on the target positions, and the particle data is updated until the plurality of particles reach the respective target positions (Gopalakrishnan discloses “For voxels that do not interact with a surface, the move operation is computationally quite simple. The entire population of a state is moved from its current voxel to its destination voxel during every time increment. At the same time, the particles of the destination voxel are moved from that voxel to their own destination voxels. For example, an energy level 1 particle that is moving in the +1x and +1y direction (1, 0, 0) is moved from its current voxel to one that is +1 over in the x direction and 0 for other direction. The particle ends up at its destination voxel with the same state it had before the move (1,0,0). Interactions within the voxel will likely change the particle count for that state based on local interactions with other particles and surfaces. If not, the particle will continue to move along the lattice at the same speed and direction” in [0127].) As to Claim 15, Liu in view of Gopalakrishnan teaches The non-transitory computer-readable storage medium according to claim 14, wherein: the information processing apparatus stores post-change data related to a shape of an object after the existing object has changed over time; a mesh for the voxel object is generated based on the voxel data based on the particle data at least until the plurality of particles reach the respective target positions; and at a predetermined point in time after the plurality of particles have reached the respective target positions, mesh generation based on the voxel data based on the particle data is ended, and a mesh is generated based on the post-change data (Liu discloses “The method includes: generating a target model located in a virtual scene and a particle model corresponding to the target model; wherein the particle model and the target model are set overlapping in the virtual scene; the particle model includes multiple particles connected by virtual springs; the shape formed by the multiple particles matches the shape of the target model… there is a preset mapping relationship between the particles and the mesh vertices; in response to the particle model detecting a collision event, determining the first position of the particles in the particle model after the collision event occurs based on the collision parameters of the collision event and the deformation threshold of the virtual springs; determining the first rendering parameters of the mesh vertices in the target model based on the first position of the particles in the particle model and the mapping relationship between the particles and the mesh vertices; and rendering the mesh vertices in the target model using the first rendering parameters to obtain the deformed target model” in [0004]. Gopalakrishnan also discloses “For voxels that do not interact with a surface, the move operation is computationally quite simple. The entire population of a state is moved from its current voxel to its destination voxel during every time increment. At the same time, the particles of the destination voxel are moved from that voxel to their own destination voxels. For example, an energy level 1 particle that is moving in the +1x and +1y direction (1, 0, 0) is moved from its current voxel to one that is +1 over in the x direction and 0 for other direction. The particle ends up at its destination voxel with the same state it had before the move (1,0,0). Interactions within the voxel will likely change the particle count for that state based on local interactions with other particles and surfaces. If not, the particle will continue to move along the lattice at the same speed and direction” in [0127], see also time-evolution of the distribution function in [0066] and Fig 1 & 3.) Claim 16 recites similar limitations as claim 1 but in a system form. Therefore, the same rationale used for claim 1 is applied. Claim 17 recites similar limitations as claim 1 but in an apparatus form. Therefore, the same rationale used for claim 1 is applied. Claim 18 recites similar limitations as claim 1 but in a method form. Therefore, the same rationale used for claim 1 is applied. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to WEIMING HE whose telephone number is (571)270-1221. The examiner can normally be reached on Monday-Friday, 8:30am-5:00pm. 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, Tammy Goddard can be reached on 571-272-7773. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see https://ppair-my.uspto.gov/pair/PrivatePair. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /WEIMING HE/ Primary Examiner, Art Unit 2611
Read full office action

Prosecution Timeline

Jan 27, 2025
Application Filed
Sep 02, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12725332
SELECTING FASHION ITEMS FOR AN AVATAR
2y 4m to grant Granted Sep 01, 2026
Patent 12720007
IMAGE DISPLAYING METHOD, INFORMATION PROCESSING APPARATUS, AND NON-TRANSITORY COMPUTER-READABLE STORAGE MEDIUM STORING PROGRAM
3y 3m to grant Granted Aug 25, 2026
Patent 12703209
VEHICLE MONITORING SYSTEM
1y 6m to grant Granted Aug 11, 2026
Patent 12639877
REFINEMENT OF FACIAL KEYPOINT METADATA GENERATION FOR VIDEO CONFERENCING OR OTHER APPLICATIONS
3y 6m to grant Granted May 26, 2026
Patent 12632615
DATA SERIALIZATION EXTRUSION FOR CONVERTING TWO-DIMENSIONAL IMAGES TO THREE-DIMENSIONAL GEOMETRY
5y 11m to grant Granted May 19, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
46%
Grant Probability
58%
With Interview (+11.9%)
3y 4m (~1y 8m remaining)
Median Time to Grant
Low
PTA Risk
Based on 423 resolved cases by this examiner. Grant probability derived from career allowance 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