We propose a novel method for addressing the problem of efficiently generating a highly refined normal map for screen-space fluid rendering. Because the process of filtering the normal map is crucially important to ensure the quality of the final screen-space fluid rendering, we employ a conditional generative adversarial network (cGAN) as a filter that learns a deep normal map representation, thereby refining the low-quality normal map. In particular, we have designed a novel loss function dedicated to refining the normal map information, and we use a specific set of auxiliary features to train the cGAN generator to learn features that are more robust with respect to edge details. Additionally, we constructed a dataset of six different typical scenes to enable effective demonstrations of multitype fluid simulation. Experiments indicated that our generator was able to infer clearer and more detailed features for this dataset than a basic screen-space fluid rendering method. Moreover, in some cases, the results generated by our method were even smoother than those generated by the conventional surface reconstruction method. Our method improves the fluid rendering results via the high-quality normal map while preserving the advantages of the screen-space fluid rendering methods and the traditional surface reconstruction methods, including that of the computation time being independent of the number of simulation particles and the spatial resolution being related only to image resolution.

In this paper, we propose a highly efficient method for synthesizing high-resolution(HR) smoke simulations based on deep learning. A major issue for physics-based HR fluid simulations is that they require large amounts of physical memory and long execution times. In recent years, this issue has been addressed by developing deep-learning-based super-resolution(SR) methods that convert low-resolution(LR) fluid simulation results to HR(High-resolution) versions. However, these methods were not very efficient because they performed operations even in areas with low density or no density. In this paper, we propose a method that can maximize its efficiency by introducing a downscaled and binarized adaptive octree. However, even if it is divided by octree, because the number of nodes increases when the resolution of the simulation space is large, we reduce the size of the space by multiscaling and at the same time perform binarization to preserve the density that may be lost in this process. The octree calculated in this process has a structure similar to that of a multigrid solver, and the octree calculated at coarse resolution is restored to its original size and used for HR expression. Finally, we apply the SR process only to those areas having significant density values. Using the proposed method, the SR process is significantly faster and the memory efficiency is improved. The performance of our method is compared with that of an existing SR method to demonstrate its efficiency.

사단법인 한국컴퓨터그래픽스학회의 논문지로서 그래픽스 분야와 그에 연관된 연구영역의 새로운 발견과 최첨단 연구결과를 발표하는 토론의 장입니다. 학회를 대표하는 학술지인 논문지는 1995년에 논문지 발간을 시작으로 2000년부터 3월, 6월, 9월, 12월 총 4회 발간되었고, 2015년부터는 KCGS 학술대회 특별호를 7월에 발간하면서 총 5회 발간되고 있습니다.