Monte Carlo geometry processing: a grid-free approach to PDE-based methods on volumetric domains
Monte Carlo geometry processing: a grid-free approach to PDE-based methods on volumetric domains
复制标题
蒙特卡罗几何处理:体积域上基于偏微分方程的无网格方法
DOI:
10.1145/3386569.3392374
复制
发表时间:
2020
影响因子:
6.2
通讯作者:
Crane, Keenan
中科院分区:
文献类型:
--
作者:
Sawhney, Rohan;Crane, Keenan
The complexity of geometric models has increased dramatically in recent years, but is still far from matching the complexity found in nature—consider, for instance, detailed microstructures that give rise to physical or biological behavior (Fig. 1). PDE-based methods provide powerful tools for processing and analyzing such data, but have not yet reached a point where algorithms “just work”: even basic tasks still entail careful preprocessing or parameter tuning, and robust algorithms can exhibit poor scaling in time or memory. Monte Carlo methods provide new opportunities for geometry processing, making a sharp break with traditional finite element methods (FEM). In particular, by avoiding the daunting challenge of mesh generation they offer a framework that is highly scalable, parallelizable, and numerically robust, and significantly expands the kind of geometry that can be used in PDE-based algorithms. Photorealistic rendering experienced an analogous development around the 1990s: finite element radiosity [Goral et al. 1984] gave way to Monte Carlo integration of the light transport equation [Kajiya 1986], for reasons that are nicely summarized by Wann Jensen [2001, Chapter 1]. Although this shift was motivated in part by a desire for more complex illumination, it has also made it possible to work with scenes of extreme geometric complexity—modern renderers handle trillions of effective polygons [Georgiev et al. 2018]