Efficient Kernel Convolution for Smooth Surfaces without Edge Effects
Alexander Gribov

TL;DR
This paper introduces a novel integer transformation method to improve kernel convolution efficiency for smooth surface data, reducing computational volume and avoiding edge effects in FFT-based simulations.
Contribution
It presents a new approach that minimizes the enclosing box volume for kernel convolution on surfaces, enhancing efficiency over traditional 3D FFT methods.
Findings
Reduces computational volume for surface-based kernel convolution
Improves efficiency of FFT-based simulations on surfaces
Avoids edge effects in kernel convolution processes
Abstract
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be processed in a three-dimensional enclosing box. This paper describes a novel approach based on integer transformation to reduce the volume of the enclosing box.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputer Graphics and Visualization Techniques · Model Reduction and Neural Networks · Electromagnetic Scattering and Analysis
