# US 2026/0065575 A1 · Rmip: fast tessellation-free gpu displacement ray tracing via inversion and oblong bounding simulation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0065575 A1
- Document ID: US20260065575A1
- Status: Published application
- Kind: A1
- Application number: 19/381,627
- Filed: 2025-11-06
- Published: 2026-03-05
- Earliest claimed: 2023-11-21
- Assignees: Adobe Inc.
- Applicants: Adobe Inc.
- Inventors: Theo Thonat; Tamy Boubekeur; Iliyan Georgiev; Francois Beaune
- Web page: https://patentgrep.com/patent/US20260065575A1

## CPC

- G06T 15/04: Texture mapping
- G06T 15/06: Ray-tracing
- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A system generates, based on a displacement bounds data structure and a triangle mesh modeling a surface of a 3D virtual object within a 3D virtual scene, a displaced triangle mesh including one or more displaced surface bounding prisms, each of the one or more displaced surface bounding prisms displaced from a respective base triangle of a plurality of base triangles of the triangle mesh structure based on displacement bounds defined in a displacement bounds data structure for an area of a 2D texture space corresponding to a location of the respective base triangle defined by the 3D virtual scene. The system performs, using the displaced triangle mesh structure, a ray tracing process for a ray associated with a pixel of a 2D image of the virtual scene including determining, responsive to determining the ray intersects the particular displaced surface bounding prism, a location of an intersection of the ray.

## Claims

### Claim 1

A non-transitory computer-readable medium storing executable instructions, which when executed by a processing device, cause the processing device to perform operations comprising:
accessing a displaced triangle mesh structure comprising one or more displaced surface bounding prisms, each of the one or more displaced surface bounding prisms displaced from a respective base triangle of a triangle mesh structure that models a surface of a three-dimensional (3D) object depicted in a 3D virtual scene;
performing, using the displaced triangle mesh structure, a ray tracing process for a ray associated with a pixel of a two-dimensional (2D) image of the virtual scene, wherein performing the ray tracing process comprises:
responsive to determining that the ray intersects a particular displaced surface bounding prism in the 3D virtual scene, determining a location of an intersection of the ray in a 2D texture space defined by a 2D displacement texture model defining a texture for the surface of the 3D object, wherein determining the location of the intersection comprises:
determining, based on the determined first endpoint and the determined second endpoint, an initial bounded area in the 2D texture space;
subdividing, at a middle of the initial bounded area of the 2D texture space, the initial bounded area to generate a first subdivided bounded area and a second subdivided bounded area, wherein a path of the ray intersects the first subdivided bounded area prior to intersecting the second subdivided bounded area;
based on the first subdivided bounded area and the second subdivided bounded area, generating a first subdivided axis-aligned bounding box (“AABB”) corresponding to the first subdivided bounded area and a second subdivided AABB corresponding to the second subdivided bounded area;
determining that the ray intersects the first subdivided AABB at a first AABB endpoint and a second AABB endpoint;
determining, based on the determined first AABB endpoint and the determined second AABB endpoint, an updated bounded area in the 2D texture space, wherein the updated bounded area has smaller dimensions than the initial bounded area; and
determining, within the updated bounded area of the 2D texture space, the location.

### Claim 2 (depends on 1)

The non-transitory computer-readable medium of claim 1, the operations further comprising:
responsive to determining that the updated bounded area in the 2D texture space is smaller than a threshold area, performing a texel marching process to determine the location of the intersection.

### Claim 3 (depends on 1)

The non-transitory computer-readable medium of claim 1, the operations further comprising:
accessing a two-dimensional (2D) displacement texture map defining the texture for at least a region of the surface of the 3D virtual object; and
generating, based on the 2D displacement texture map, a displacement bounds data structure that defines displacement bounds for an area of the base triangle associated with the particular displaced surface bounding prism, wherein the displaced surface bounding prism in the 3D virtual scene is displaced from the base triangle based on the displacement bounds for the area.

### Claim 4 (depends on 3)

The non-transitory computer-readable medium of claim 3, wherein the displacement bounds data structure comprises a rectangular minmax image pyramid (RMIP) data structure, wherein the area comprises a rectangular area.

### Claim 5 (depends on 4)

The computer-readable medium of claim 4, wherein the displacement bounds comprise a minimum displacement bound, wherein the particular displaced surface bounding prism is displaced from the base triangle based on the minimum displacement bound.

### Claim 6 (depends on 4)

The computer-readable medium of claim 4, wherein the displacement bounds comprise a maximum displacement bound, wherein the particular displaced surface bounding prism is displaced from the base triangle based on the maximum displacement bound.

### Claim 7 (depends on 1)

The computer-readable medium of claim 1 wherein determining a location of an intersection of the ray at the 2D texture space comprises:
determining, based on the determined first endpoint and the determined second endpoint, an initial bounded area in the 2D texture space;
subdividing, at a middle of the initial bounded area of the 2D texture space, the initial bounded area to generate a first subdivided bounded area and a second subdivided bounded area, wherein a path of the ray intersects the first subdivided bounded area prior to intersecting the second subdivided bounded area;
based on the first subdivided bounded area and the second subdivided bounded area, generating a first subdivided axis-aligned bounding box (“AABB”) corresponding to the first subdivided bounded area and a second subdivided AABB corresponding to the second subdivided bounded area; and
determining that the ray intersects the first subdivided AABB at a first AABB endpoint and a second AABB endpoint;
determining, based on the determined first AABB endpoint and the determined second AABB endpoint, an updated bounded area in the 2D texture space, wherein the updated bounded area has smaller dimensions than the initial bounded area; and
determining, within the updated bounded area of the 2D texture space, the location.

### Claim 8

A method performed by one or more computing devices associated with a scene rendering system, comprising:
accessing a displaced triangle mesh structure comprising one or more displaced surface bounding prisms, each of the one or more displaced surface bounding prisms displaced from a respective base triangle of a triangle mesh structure that models a surface of a three-dimensional (3D) object depicted in a 3D virtual scene;
performing, using the displaced triangle mesh structure, a ray tracing process for a ray associated with a pixel of a two-dimensional (2D) image of the virtual scene, wherein performing the ray tracing process comprises:
responsive to determining that the ray intersects a particular displaced surface bounding prism in the 3D virtual scene, determining a location of an intersection of the ray in a 2D texture space defined by a 2D displacement texture model defining a texture for the surface of the 3D object, wherein determining the location of the intersection comprises:
determining, based on the determined first endpoint and the determined second endpoint, an initial bounded area in the 2D texture space;
subdividing, at a middle of the initial bounded area of the 2D texture space, the initial bounded area to generate a first subdivided bounded area and a second subdivided bounded area, wherein a path of the ray intersects the first subdivided bounded area prior to intersecting the second subdivided bounded area;
based on the first subdivided bounded area and the second subdivided bounded area, generating a first subdivided axis-aligned bounding box (“AABB”) corresponding to the first subdivided bounded area and a second subdivided AABB corresponding to the second subdivided bounded area;
determining that the ray intersects the first subdivided AABB at a first AABB endpoint and a second AABB endpoint;
determining, based on the determined first AABB endpoint and the determined second AABB endpoint, an updated bounded area in the 2D texture space, wherein the updated bounded area has smaller dimensions than the initial bounded area; and
determining, within the updated bounded area of the 2D texture space, the location.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
responsive to determining that the updated bounded area in the 2D texture space is smaller than a threshold area, performing a texel marching process to determine the location of the intersection.

### Claim 10 (depends on 8)

The method of claim 8, further comprising:
accessing a two-dimensional (2D) displacement texture map defining the texture for at least a region of the surface of the 3D virtual object; and
generating, based on the 2D displacement texture map, a displacement bounds data structure that defines displacement bounds for an area of the base triangle associated with the particular displaced surface bounding prism, wherein the displaced surface bounding prism in the 3D virtual scene is displaced from the base triangle based on the displacement bounds for the area.

### Claim 11 (depends on 10)

The method of claim 10, wherein the displacement bounds data structure comprises a rectangular minmax image pyramid (RMIP) data structure, wherein the area comprises a rectangular area.

### Claim 12 (depends on 11)

The method of claim 11, wherein the displacement bounds comprise a minimum displacement bound, wherein the particular displaced surface bounding prism is displaced from the base triangle based on the minimum displacement bound.

### Claim 13 (depends on 11)

The method of claim 11, wherein the displacement bounds comprise a maximum displacement bound, wherein the particular displaced surface bounding prism is displaced from the base triangle based on the maximum displacement bound.

### Claim 14 (depends on 8)

The method of claim 8, wherein determining a location of an intersection of the ray at the 2D texture space comprises:
determining, based on the determined first endpoint and the determined second endpoint, an initial bounded area in the 2D texture space;
subdividing, at a middle of the initial bounded area of the 2D texture space, the initial bounded area to generate a first subdivided bounded area and a second subdivided bounded area, wherein a path of the ray intersects the first subdivided bounded area prior to intersecting the second subdivided bounded area;
based on the first subdivided bounded area and the second subdivided bounded area, generating a first subdivided axis-aligned bounding box (“AABB”) corresponding to the first subdivided bounded area and a second subdivided AABB corresponding to the second subdivided bounded area; and
determining that the ray intersects the first subdivided AABB at a first AABB endpoint and a second AABB endpoint;
determining, based on the determined first AABB endpoint and the determined second AABB endpoint, an updated bounded area in the 2D texture space, wherein the updated bounded area has smaller dimensions than the initial bounded area; and
determining, within the updated bounded area of the 2D texture space, the location.

### Claim 15

A system comprising:
a memory component; and
a processing device coupled to the memory component, the processing device to perform operations comprising:
accessing a displaced triangle mesh structure comprising one or more displaced surface bounding prisms, each of the one or more displaced surface bounding prisms displaced from a respective base triangle of a triangle mesh structure that models a surface of a three-dimensional (3D) object depicted in a 3D virtual scene;
performing, using the displaced triangle mesh structure, a ray tracing process for a ray associated with a pixel of a two-dimensional (2D) image of the virtual scene, wherein performing the ray tracing process comprises:
responsive to determining that the ray intersects a particular displaced surface bounding prism in the 3D virtual scene, determining a location of an intersection of the ray in a 2D texture space defined by a 2D displacement texture model defining a texture for the surface of the 3D object, wherein determining the location of the intersection comprises:
determining, based on the determined first endpoint and the determined second endpoint, an initial bounded area in the 2D texture space;
subdividing, at a middle of the initial bounded area of the 2D texture space, the initial bounded area to generate a first subdivided bounded area and a second subdivided bounded area, wherein a path of the ray intersects the first subdivided bounded area prior to intersecting the second subdivided bounded area;
based on the first subdivided bounded area and the second subdivided bounded area, generating a first subdivided axis-aligned bounding box (“AABB”) corresponding to the first subdivided bounded area and a second subdivided AABB corresponding to the second subdivided bounded area;
determining that the ray intersects the first subdivided AABB at a first AABB endpoint and a second AABB endpoint;
determining, based on the determined first AABB endpoint and the determined second AABB endpoint, an updated bounded area in the 2D texture space, wherein the updated bounded area has smaller dimensions than the initial bounded area; and
determining, within the updated bounded area of the 2D texture space, the location.

### Claim 16 (depends on 15)

The system of claim 15, the operations further comprising:
responsive to determining that the updated bounded area in the 2D texture space is smaller than a threshold area, performing a texel marching process to determine the location of the intersection.

### Claim 17 (depends on 15)

The system of claim 15, the operations further comprising:
accessing a two-dimensional (2D) displacement texture map defining the texture for at least a region of the surface of the 3D virtual object; and
generating, based on the 2D displacement texture map, a displacement bounds data structure that defines displacement bounds for an area of the base triangle associated with the particular displaced surface bounding prism, wherein the displaced surface bounding prism in the 3D virtual scene is displaced from the base triangle based on the displacement bounds for the area.

### Claim 18 (depends on 17)

The system of claim 17, wherein the displacement bounds data structure comprises a rectangular minmax image pyramid (RMIP) data structure, wherein the area comprises a rectangular area.

### Claim 19 (depends on 18)

The system of claim 18, wherein the displacement bounds comprise a minimum displacement bound, wherein the particular displaced surface bounding prism is displaced from the base triangle based on the minimum displacement bound.

### Claim 20 (depends on 18)

The system of claim 18, wherein the displacement bounds comprise a maximum displacement bound, wherein the particular displaced surface bounding prism is displaced from the base triangle based on the maximum displacement bound.
