Unlock instant, AI-driven research and patent intelligence for your innovation.

A Hierarchical Bounding Box Construction Method Based on Dynamic Task Scheduling

A technology of hierarchical bounding boxes and construction methods, which is applied in the directions of program startup/switching, multi-program installation, and inter-program communication, etc., which can solve problems such as high computing costs, and achieve high utilization rate, construction speed, and high frame rate. Effect

Active Publication Date: 2020-03-10
WUHAN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This technique typically produces higher quality pictures than typical scanline rendering methods, but requires higher computational costs

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Hierarchical Bounding Box Construction Method Based on Dynamic Task Scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0034] The technical solution adopted in the present invention is: a hierarchical bounding box construction algorithm based on dynamic task scheduling, which is characterized by the following steps:

[0035] Step 1: Initialize the global variable g_optimizecounter in the GPU, which indicates the number of tasks currently completed and running, and allocate shared memory;

[0036] Step 2: Assign tasks to threads according to the g_optimizecounter value and the number of scene triangles;

[0037] Step 3: Combining with the task ID, traverse the BVH from top to top, and read the data required for young tree reconstruction to local variables;

[0038] Step 4: When there is at least one thread in the warp, and there are 9 leaf nodes under the internal node in the thread, use warp-level programming to reconstruct the young tree with the clustering method;

[0039] Step 5: Repeat step 2 until the set end condition is reached, and the GPU outputs the calculation result;

[0040] The...

Embodiment 2

[0055] The principle of the present invention will be further described below in conjunction with Embodiment 2. please see figure 1 , the technical solution adopted in the present invention is: the i bounding box construction algorithm based on dynamic task scheduling, comprising the following steps:

[0056]Step 1: Initialize the global variables in the GPU, g_optimizecounter indicates the number of currently completed and running tasks, and allocate shared memory; among them, the allocation of shared memory is to determine the internal nodes of the young tree and the leaf nodes of the young tree according to the number of leaf nodes of the young tree , the surface area of ​​the leaf node bounding box of the sapling and the shared memory size occupied by the distance matrix respectively.

[0057] Step 2: Assign tasks to threads according to the g_optimizecounter value and the number of scene triangles; use the built-in numerical function of the GPU to count the number of thr...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a hierarchical bounding box establishing method which belongs to the field of computer graphic processing, and particularly to a hierarchical bounding box establishing method based on dynamic task scheduling. According to the method of the invention, in traversal of BVH, one thread corresponds with a leaf node; and in cluster sapling rebuilding, one warp corresponds with two inner nodes so that parallelism of a BVH construction algorithm on a single host computer is further improved. Compared with a current universal method, the hierarchical bounding box establishing method is advantageous in that BVH rebuilding speed is improved by about 25%.

Description

technical field [0001] The invention relates to a method for constructing a hierarchical bounding box, belonging to the technical field of computer graphics processing, in particular to a method for constructing a hierarchical bounding box based on dynamic task scheduling. Background technique [0002] Ray Tracing (Ray Tracing) is a technology that traces the ray formed by connecting the viewpoint and the pixel on the pixel plane in a planar image, and calculates the intersection point of the ray with the object in the scene to set the pixel attribute. It was developed by Appe in 1968. propose. This technique generally produces higher quality pictures than typical scanline rendering methods, but requires higher computational costs. This makes ray tracing more suitable for offline rendering such as film and TV visual effects, still images, and less suitable for real-time rendering such as games. In addition, ray tracing can be used to simulate optical effects such as reflec...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06T1/00G06F9/48G06F9/54
CPCG06F9/4843G06F9/544G06T1/00
Inventor 何发智张正昌黎明丽陈壹林
Owner WUHAN UNIV