Thin Voxelization Algorithm for 3D Surface Rendering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional surface voxelization techniques render unnecessary voxels, leading to decreased performance in rendering systems, especially when dealing with open meshes in 3D graphics, as they fail to accurately select voxels that contribute to the final result.
Innovation Solution
The thin voxelization algorithm maps a surface onto a regularly spaced array of voxels and generates values only for voxels that intersect with the surface, using a crosshair shape to determine intersection, thereby reducing unnecessary voxel rendering and maintaining separation properties.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional surface voxelization techniques are used, then all voxels intersecting the surface are rendered, but unnecessary voxels are included leading to decreased rendering performance
Solution Approach 1:
The invention segments the surface intersection detection into two distinct parts: (1) detecting which voxels are potentially intersected by the surface, and (2) filtering out voxels that do not actually contribute to the final rendering result. This segmentation allows the algorithm to efficiently identify and exclude unnecessary voxels, resolving the contradiction between comprehensive voxel coverage and rendering performance.
Solution Approach 2:
The invention applies local quality by differentiating between voxels that require full processing and those that can be excluded. By introducing the crosshair shape concept, the patent creates a localized quality criterion: only voxels where the surface actually intersects the crosshair (not just the voxel boundary) are tagged for rendering. This local differentiation eliminates unnecessary computations while preserving visual accuracy.
2Measurement precision
If conventional surface voxelization techniques are used, then simplicity of implementation is maintained, but accuracy in selecting contributing voxels deteriorates
Solution Approach 1:
The invention resolves the accuracy-complexity contradiction by introducing an additional dimensional concept: the crosshair shape within each voxel. Instead of simply checking if a surface intersects a voxel's boundary (2D/3D space), the algorithm checks intersection with the crosshair (adding an internal structural dimension). This dimensional enhancement provides precise voxel selection criteria without requiring complex algorithms, as the crosshair intersection test remains computationally efficient.
Data Source
AI summary
A system, method, and computer program product for implementing an algorithm for performing thin voxelization is disclosed. The thin voxelization algorithm receives a surface, maps the surface onto a plurality of volumetric picture elements (voxels), and generates a value for each voxel in the plurality of voxels that intersects with the surface. A voxel intersects with the surface when the surface intersects a crosshair shape associated with the voxel.