A Fast and Memory-Efficient Direct Rendering Method for Polynomial-Based Implicit Surfaces  

作　　者：Jiayu Ren Susumu Nakata 

机构地区：[1]Graduate School of Information Science and Engineering,Ritsumeikan University,Ibaraki,Osaka,567-8570,Japan2 [2]College School of Information Science and Engineering,Ritsumeikan University,Ibaraki,Osaka,567-8570,Japan

出　　处：《Computer Modeling in Engineering & Sciences》2024年第11期1033-1046,共14页工程与科学中的计算机建模（英文）

基　　金：supported by JSPS KAKENHI Grant Number 21K11928。

摘　　要：Three-dimensional surfaces are typically modeled as implicit surfaces.However,direct rendering of implicit surfaces is not simple,especially when such surfaces contain finely detailed shapes.One 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 rays.In particular,ray-casting requires many function evaluations along each ray,severely slowing the rendering speed.In 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 polynomials.In experiments,the proposed method achieved a high framerate performance for different test cases,with a speed-up factor ranging from 1.1 to 218.2.In addition,the proposed method demonstrated better efficiency with high cell resolution.In terms of memory consumption,the proposed method saved between 90.94%and 99.64%in different test cases.Generally,the proposed method became more memory-efficient as the cell resolution increased.

关 键 词：Implicit surfaces direct rendering ray marching 

分 类 号：O17[理学—数学]