ACM Trans. Graph.最新文献_第2页

SPCBPT: subspace-based probabilistic connections for bidirectional path tracing 用于双向路径跟踪的基于子空间的概率连接

ACM Trans. Graph. Pub Date : 2022-01-01 DOI: 10.1145/3528223.3530183

Fujia Su, Sheng Li, Guoping Wang

{"title":"SPCBPT: subspace-based probabilistic connections for bidirectional path tracing","authors":"Fujia Su, Sheng Li, Guoping Wang","doi":"10.1145/3528223.3530183","DOIUrl":"https://doi.org/10.1145/3528223.3530183","url":null,"abstract":"Bidirectional path tracing (BDPT) can be accelerated by selecting appropri- ate light sub-paths for connection. However, existing algorithms need to perform frequent distribution reconstruction and have expensive overhead. We present a novel approach, SPCBPT, for probabilistic connections that constructs the light selection distribution in sub-path space. Our approach bins the sub-paths into multiple subspaces and keeps the sub-paths in the same subspace of low discrepancy, wherein the light sub-paths can be selected by a subspace-based two-stage sampling method, i.e., sampling the light subspace and then resampling the light sub-paths within this subspace. The subspace-based distribution is free of reconstruction and provides efficient light selection at a very low cost. We also propose a method that considers the Multiple Importance Sampling (MIS) term in the light selection and thus obtain an MIS-aware distribution that can minimize the upper bound of variance of the combined estimator. Prior methods typically omit this MIS weights term. We evaluate our algorithm using various benchmarks, and the results show that our approach has superior performance and can significantly reduce the noise compared with the state-of-the-art method.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"44 1","pages":"77:1-77:14"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78502438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

TopoCut: fast and robust planar cutting of arbitrary domains TopoCut:快速和鲁棒的任意域的平面切割

ACM Trans. Graph. Pub Date : 2022-01-01 DOI: 10.1145/3528223.3530149

Xianzhong Fang, H. Bao, Jin Huang

引用次数: 3

StrokeStrip: joint parameterization and fitting of stroke clusters StrokeStrip:行程簇的关节参数化和拟合

ACM Trans. Graph. Pub Date : 2021-01-01 DOI: 10.1145/3450626.3459777

Dave Pagurek van Mossel, Chenxi Liu, Nicholas Vining, Mikhail Bessmeltsev, A. Sheffer

引用次数: 0

Weavecraft: an interactive design and simulation tool for 3D weaving Weavecraft: 3D编织的交互式设计和模拟工具

ACM Trans. Graph. Pub Date : 2020-11-26 DOI: 10.1145/3414685.3417865

Rundong Wu, Joy Xiaoji Zhang, Jonathan Leaf, Xinru Hua, Ante Qu, Claire Harvey, Emily Holtzman, Joy Ko, B. Hagan, Doug L. James, François Guimbretière, Steve Marschner

引用次数: 10

Monolith: a monolithic pressure-viscosity-contact solver for strong two-way rigid-rigid rigid-fluid coupling Monolith:用于强双向刚性-刚性-流体耦合的单片压力-粘度-接触求解器

ACM Trans. Graph. Pub Date : 2020-11-26 DOI: 10.1145/3414685.3417798

Tetsuya Takahashi, Christopher Batty

引用次数: 13

Stormscapes: simulating cloud dynamics in the now 风暴景观:模拟现在的云动力学

ACM Trans. Graph. Pub Date : 2020-11-26 DOI: 10.1145/3414685.3417801

Torsten Hädrich, Milosz Makowski, Wojciech Palubicki, D. Banuti, S. Pirk, D. Michels

{"title":"Stormscapes: simulating cloud dynamics in the now","authors":"Torsten Hädrich, Milosz Makowski, Wojciech Palubicki, D. Banuti, S. Pirk, D. Michels","doi":"10.1145/3414685.3417801","DOIUrl":"https://doi.org/10.1145/3414685.3417801","url":null,"abstract":"The complex interplay of a number of physical and meteorological phenomena makes simulating clouds a challenging and open research problem. We explore a physically accurate model for simulating clouds and the dynamics of their transitions. We propose first-principle formulations for computing buoyancy and air pressure that allow us to simulate the variations of atmospheric density and varying temperature gradients. Our simulation allows us to model various cloud types, such as cumulus, stratus, and stratoscumulus, and their realistic formations caused by changes in the atmosphere. Moreover, we are able to simulate large-scale cloud super cells – clusters of cumulonimbus formations – that are commonly present during thunderstorms. To enable the efficient exploration of these stormscapes, we propose a lightweight set of high-level parameters that allow us to intuitively explore cloud formations and dynamics. Our method allows us to simulate cloud formations of up to about 20 km × 20 km extents at interactive rates. We explore the capabilities of physically accurate and yet interactive cloud simulations by showing numerous examples and by coupling our model with atmosphere measurements of real-time weather services to simulate cloud formations in the now. Finally, we quantitatively assess our model with cloud fraction profiles, a common measure for comparing cloud types.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"3 1","pages":"175:1-175:16"},"PeriodicalIF":0.0,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75029438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Match: differentiable material graphs for procedural material capture 匹配:用于程序材料捕获的可微分材料图

ACM Trans. Graph. Pub Date : 2020-11-26 DOI: 10.1145/3414685.3417781

Liang Shi, Beichen Li, Miloš Hašan, Kalyan Sunkavalli, T. Boubekeur, R. Mech, W. Matusik

引用次数: 45

VDAC: volume decompose-and-carve for subtractive manufacturing VDAC:用于减法制造的体积分解和雕刻

ACM Trans. Graph. Pub Date : 2020-11-26 DOI: 10.1145/3414685.3417772

Ali Mahdavi-Amiri, Fenggen Yu, Haisen Zhao, Adriana Schulz, Hao Zhang

引用次数: 13

Pixelor: a competitive sketching AI agent. so you think you can sketch? Pixelor:一个竞争性素描AI代理。你觉得你会素描吗?

ACM Trans. Graph. Pub Date : 2020-11-26 DOI: 10.1145/3414685.3417840

A. Bhunia, Ayan Das, U. Muhammad, Yongxin Yang, Timothy M. Hospedales, T. Xiang, Yulia Gryaditskaya, Yi-Zhe Song

{"title":"Pixelor: a competitive sketching AI agent. so you think you can sketch?","authors":"A. Bhunia, Ayan Das, U. Muhammad, Yongxin Yang, Timothy M. Hospedales, T. Xiang, Yulia Gryaditskaya, Yi-Zhe Song","doi":"10.1145/3414685.3417840","DOIUrl":"https://doi.org/10.1145/3414685.3417840","url":null,"abstract":"We present the first competitive drawing agent Pixelor that exhibits human-level \u0000performance at a Pictionary-like sketching game, where the participant whose sketch is recognized first is a winner. Our AI agent can autonomously \u0000sketch a given visual concept, and achieve a recognizable rendition as quickly \u0000or faster than a human competitor. The key to victory for the agent’s goal \u0000is to learn the optimal stroke sequencing strategies that generate the most \u0000recognizable and distinguishable strokes first. Training Pixelor is done in two \u0000steps. First, we infer the stroke order that maximizes early recognizability of \u0000human training sketches. Second, this order is used to supervise the training \u0000of a sequence-to-sequence stroke generator. Our key technical contributions \u0000are a tractable search of the exponential space of orderings using neural \u0000sorting; and an improved Seq2Seq Wasserstein (S2S-WAE) generator that \u0000uses an optimal-transport loss to accommodate the multi-modal nature of the \u0000optimal stroke distribution. Our analysis shows that Pixelor is better than the \u0000human players of the Quick, Draw! game, under both AI and human judging \u0000of early recognition. To analyze the impact of human competitors’ strategies, \u0000we conducted a further human study with participants being given unlimited \u0000thinking time and training in early recognizability by feedback from an AI \u0000judge. The study shows that humans do gradually improve their strategies \u0000with training, but overall Pixelor still matches human performance. The code \u0000and the dataset are available at http://sketchx.ai/pixelor.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"5 1","pages":"166:1-166:15"},"PeriodicalIF":0.0,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87622497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 23

LoopyCuts: practical feature-preserving block decomposition for strongly hex-dominant meshing LoopyCuts:用于强十六进制优势网格的实用特征保留块分解

ACM Trans. Graph. Pub Date : 2020-07-08 DOI: 10.1145/3386569.3392472

Marco Livesu, N. Pietroni, E. Puppo, A. Sheffer, Paolo Cignoni

引用次数: 18