A Fast and Memory-Efficient Direct Rendering Method for Polynomial-Based Implicit Surfaces
作者机构:Graduate School of Information Science and EngineeringRitsumeikan UniversityIbarakiOsaka567-8570Japan2 College School of Information Science and EngineeringRitsumeikan UniversityIbarakiOsaka567-8570Japan
出 版 物:《Computer Modeling in Engineering & Sciences》 (工程与科学中的计算机建模(英文))
年 卷 期:2024年第141卷第11期
页 面:1033-1046页
核心收录:
学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学]
基 金:supported by JSPS KAKENHI Grant Number 21K11928
主 题:Implicit surfaces direct rendering ray marching
摘 要:Three-dimensional surfaces are typically modeled as implicit ***,direct rendering of implicit surfaces is not simple,especially when such surfaces contain finely detailed *** approach is ray-casting,where the field of the implicit surface is assumed to be piecewise polynomials defined on the grid of a rectangular domain.A critical issue for direct rendering based on ray-casting is the computational cost of finding intersections between surfaces and *** particular,ray-casting requires many function evaluations along each ray,severely slowing the rendering *** this paper,a method is proposed to achieve direct rendering of polynomial-based implicit surfaces in real-time by strategically narrowing the search range and designing the shader to exploit the structure of piecewise *** experiments,the proposed method achieved a high framerate performance for different test cases,with a speed-up factor ranging from 1.1 to *** addition,the proposed method demonstrated better efficiency with high cell *** terms of memory consumption,the proposed method saved between 90.94%and 99.64%in different test ***,the proposed method became more memory-efficient as the cell resolution increased.