快速二维照明算法? [英] Fast 2D illumination algorithm?

问题描述

我们有一个带有半透明墙和一些光源的矩形区域.我们只考虑俯视图，所以这是一个二维问题.我们需要找到该区域每个点的近似光照(信号强度).

We have a rectangular area with translucent walls and a few light sources.We are considering only the top view,so it is a 2D problem. We need to find the approximate lighting (signal strength)at each point of the area.

我们需要让算法变得非常快.蛮力方法对我们的目的来说太慢了.您可以假设所有墙壁都以相同的量衰减，即使是恒定的衰减量也是可以接受的.

We need to make the algorithm really fast. The brute force method was just too slow for our purposes. You can assume that all walls attenuate by same amount, even constant amount of attenuation is acceptable.

该区域最多为 1000x1000，并且不会有超过 100 个光源.光源的范围可以约为.50-100 个单位(它们不是无限的).欢迎使用更快但近似的算法.

The area would be at most 1000x1000, and there would not be more than 100 light sources. The light sources can have a range of approx. 50-100 units (they are not infinite). Faster but approximate algorithms are welcome.

提前致谢！

我尝试的基本上是蛮力法:将每个样本点与每个墙壁和光源进行比较以确定其亮度.显然，它是 O(n^3) 并且慢得令人无法接受.

What I tried was basically brute force method: comparing each sample point with each wall and light source to determine its luminosity. Obviously, it is O(n^3) and unacceptably slow.

按时间我的意思不是任何特定的限制:但是在 100 毫秒或更快的时间内完成整个图像会很好.请记住，我对速度的要求并不高.

By time I did not mean any specific limit: but it would be nice to do the whole image within 100ms or faster. Remember, I do not require accuracy as much as speed.

推荐答案

只是在黑暗中刺伤:您是否研究过(GPU 加速)光子映射?

Just a stab in the dark: have you looked into (GPU-accelerated) photon mapping?

这篇关于快速二维照明算法?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！