ACM Trans. Graph.最新文献

筛选
英文 中文
Interactive design and stability analysis of decorative joinery for furniture 家具装饰细木工的交互设计与稳定性分析
ACM Trans. Graph. Pub Date : 2017-04-21 DOI: 10.1145/3072959.3126857
Jiaxian Yao, D. Kaufman, Y. Gingold, Maneesh Agrawala
{"title":"Interactive design and stability analysis of decorative joinery for furniture","authors":"Jiaxian Yao, D. Kaufman, Y. Gingold, Maneesh Agrawala","doi":"10.1145/3072959.3126857","DOIUrl":"https://doi.org/10.1145/3072959.3126857","url":null,"abstract":"High-quality hand-made furniture often employs intrinsic joints that geometrically interlock along mating surfaces. Such joints increase the structural integrity of the furniture and add to its visual appeal. We present an interactive tool for designing such intrinsic joints. Users draw the visual appearance of the joints on the surface of an input furniture model as groups of two-dimensional (2D) regions that must belong to the same part. Our tool automatically partitions the furniture model into a set of solid 3D parts that conform to the user-specified 2D regions and assemble into the furniture. If the input does not merit assemblable solid 3D parts, then our tool reports the failure and suggests options for redesigning the 2D surface regions so that they are assemblable. Similarly, if any parts in the resulting assembly are unstable, then our tool suggests where additional 2D regions should be drawn to better interlock the parts and improve stability. To perform this stability analysis, we introduce a novel variational static analysis method that addresses shortcomings of the equilibrium method for our task. Specifically, our method correctly detects sliding instabilities and reports the locations and directions of sliding and hinging failures. We show that our tool can be used to generate over 100 joints inspired by traditional woodworking and Japanese joinery. We also design and fabricate nine complete furniture assemblies that are stable and connected using only the intrinsic joints produced by our tool.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"110 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80517202","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}
引用次数: 7
Functional characterization of intrinsic and extrinsic geometry 内在和外在几何的功能表征
ACM Trans. Graph. Pub Date : 2017-04-21 DOI: 10.1145/3072959.3126796
E. Corman, J. Solomon, M. Ben-Chen, L. Guibas, M. Ovsjanikov
{"title":"Functional characterization of intrinsic and extrinsic geometry","authors":"E. Corman, J. Solomon, M. Ben-Chen, L. Guibas, M. Ovsjanikov","doi":"10.1145/3072959.3126796","DOIUrl":"https://doi.org/10.1145/3072959.3126796","url":null,"abstract":"We propose a novel way to capture and characterize distortion between pairs of shapes by extending the recently proposed framework of shape differences built on functional maps. We modify the original definition of shape differences slightly and prove that after this change, the discrete metric is fully encoded in two shape difference operators and can be recovered by solving two linear systems of equations. Then we introduce an extension of the shape difference operators using offset surfaces to capture extrinsic or embedding-dependent distortion, complementing the purely intrinsic nature of the original shape differences. Finally, we demonstrate that a set of four operators is complete, capturing intrinsic and extrinsic structure and fully encoding a shape up to rigid motion in both discrete and continuous settings. We highlight the usefulness of our constructions by showing the complementary nature of our extrinsic shape differences in capturing distortion ignored by previous approaches. We additionally provide examples where we recover local shape structure from the shape difference operators, suggesting shape editing and analysis tools based on manipulating shape differences.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90153231","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}
引用次数: 10
Multi-contact locomotion using a contact graph with feasibility predictors 基于可行性预测的接触图的多接触运动
ACM Trans. Graph. Pub Date : 2017-04-21 DOI: 10.1145/3072959.3126849
Changgu Kang, Sung-Hee Lee
{"title":"Multi-contact locomotion using a contact graph with feasibility predictors","authors":"Changgu Kang, Sung-Hee Lee","doi":"10.1145/3072959.3126849","DOIUrl":"https://doi.org/10.1145/3072959.3126849","url":null,"abstract":"Multi-contact locomotion that uses both the hands and feet in a complex environment remains a challenging problem in computer animation. To address this problem, we present a contact graph, which is a motion graph augmented by learned feasibility predictors, namely contact spaces and an occupancy estimator, for a motion clip in each graph node. By estimating the feasibilities of candidate contact points that can be reached by modifying a motion clip, the predictors allow us to find contact points that are likely to be valid and natural before attempting to generate the actual motion for the contact points. The contact graph thus enables the efficient generation of multi-contact motion in two steps: planning contact points to the goal and then generating the whole-body motion. We demonstrate the effectiveness of our method by creating several climbing motions in complex and cluttered environments by using only a small number of motion samples.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82462176","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}
引用次数: 12
Fast weather simulation for inverse procedural design of 3D urban models 面向三维城市模型逆程序设计的快速天气模拟
ACM Trans. Graph. Pub Date : 2017-04-21 DOI: 10.1145/3072959.3126839
I. Garcia-Dorado, Daniel G. Aliaga, Saiprasanth Bhalachandran, P. Schmid, D. Niyogi
{"title":"Fast weather simulation for inverse procedural design of 3D urban models","authors":"I. Garcia-Dorado, Daniel G. Aliaga, Saiprasanth Bhalachandran, P. Schmid, D. Niyogi","doi":"10.1145/3072959.3126839","DOIUrl":"https://doi.org/10.1145/3072959.3126839","url":null,"abstract":"We present the first realistic, physically based, fully coupled, real-time weather design tool for use in urban procedural modeling. We merge designing of a 3D urban model with a controlled long-lasting spatiotemporal interactive simulation of weather. Starting from the fundamental dynamical equations similar to those used in state-of-the-art weather models, we present a novel simplified urban weather model for interactive graphics. Control of physically based weather phenomena is accomplished via an inverse modeling methodology. In our results, we present several scenarios of forward design, inverse design with high-level and detailed-level weather control and optimization, and comparisons of our method against well-known weather simulation results and systems.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"112 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77980475","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}
引用次数: 7
Domain of attraction expansion for physics-based character control 基于物理的角色控制的吸引力扩展领域
ACM Trans. Graph. Pub Date : 2017-04-21 DOI: 10.1145/3072959.3126850
M. A. Borno, M. V. D. Panne, E. Fiume
{"title":"Domain of attraction expansion for physics-based character control","authors":"M. A. Borno, M. V. D. Panne, E. Fiume","doi":"10.1145/3072959.3126850","DOIUrl":"https://doi.org/10.1145/3072959.3126850","url":null,"abstract":"Determining effective control strategies and solutions for high-degree-of-freedom humanoid characters has been a difficult, ongoing problem. A controller is only valid for a subset of the states of the character, known as the domain of attraction (DOA). This article shows how many states that are initially outside the DOA can be brought inside it. Our first contribution is to show how DOA expansion can be performed for a high-dimensional simulated character. Our second contribution is to present an algorithm that efficiently increases the DOA using random trees that provide denser coverage than the trees produced by typical sampling-based motion-planning algorithms. The trees are constructed offline but can be queried fast enough for near-real-time control. We show the effect of DOA expansion on getting up, crouch-to-stand, jumping, and standing-twist controllers. We also show how DOA expansion can be used to connect controllers together.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73724509","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}
引用次数: 4
Interactive relighting in single low-dynamic range images 在单个低动态范围图像中的交互式重照明
ACM Trans. Graph. Pub Date : 2017-04-21 DOI: 10.1145/3072959.3126845
Jung-Hsuan Wu, Suguru Saito
{"title":"Interactive relighting in single low-dynamic range images","authors":"Jung-Hsuan Wu, Suguru Saito","doi":"10.1145/3072959.3126845","DOIUrl":"https://doi.org/10.1145/3072959.3126845","url":null,"abstract":"This article addresses the relighting of outdoor and large indoor scenes illuminated by nondistant lights, which has seldom been discussed in previous works. We propose a method for users to interactively edit the illumination of a scene by moving existing lights and inserting synthetic lights into the scene that requires only a small amount of user annotation and a single low-dynamic range (LDR) image. We achieve this by adopting a top-down approach that estimates the scene reflectance by fitting a diffuse illumination model to a photograph. This approach gains stability and robustness by estimating the camera, scene geometry, and light sources in sequence and by using a confidence map, which is a per-pixel weight map. The results of our evaluation demonstrates that the proposed method can estimate a scene accurately enough for realistic relighting of images. Moreover, the experimental results of our user studies show that the synthesized images are so realistic as to be almost indistinguishable from real photographs.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"63 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80089599","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}
引用次数: 0
Decomposing images into layers via RGB-space geometry 通过rgb空间几何将图像分解成层
ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126798
Jianchao Tan, Jyh-Ming Lien, Y. Gingold
{"title":"Decomposing images into layers via RGB-space geometry","authors":"Jianchao Tan, Jyh-Ming Lien, Y. Gingold","doi":"10.1145/3072959.3126798","DOIUrl":"https://doi.org/10.1145/3072959.3126798","url":null,"abstract":"In digital image editing software, layers organize images. However, layers are often not explicitly represented in the final image, and may never have existed for a scanned physical painting or a photograph. We propose a technique to decompose an image into layers. In our decomposition, each layer represents a single-color coat of paint applied with varying opacity. Our decomposition is based on the image’s RGB-space geometry. In RGB-space, the linear nature of the standard Porter-Duff [1984] “over” pixel compositing operation implies a geometric structure. The vertices of the convex hull of image pixels in RGB-space correspond to a palette of paint colors. These colors may be “hidden” and inaccessible to algorithms based on clustering visible colors. For our layer decomposition, users choose the palette size (degree of simplification to perform on the convex hull), as well as a layer order for the paint colors (vertices). We then solve a constrained optimization problem to find translucent, spatially coherent opacity for each layer, such that the composition of the layers reproduces the original image. We demonstrate the utility of the resulting decompositions for recoloring (global and local) and object insertion. Our layers can be interpreted as generalized barycentric coordinates; we compare to these and other recoloring approaches.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"114 1","pages":"7:1-7:14"},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85387012","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}
引用次数: 75
Optimal discrete slicing 最优离散切片
ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126803
M. Alexa, Kristian Hildebrand, S. Lefebvre
{"title":"Optimal discrete slicing","authors":"M. Alexa, Kristian Hildebrand, S. Lefebvre","doi":"10.1145/3072959.3126803","DOIUrl":"https://doi.org/10.1145/3072959.3126803","url":null,"abstract":"Slicing is the procedure necessary to prepare a shape for layered manufacturing. There are degrees of freedom in this process, such as the starting point of the slicing sequence and the thickness of each slice. The choice of these parameters influences the manufacturing process and its result: The number of slices significantly affects the time needed for manufacturing, while their thickness affects the error. Assuming a discrete setting, we measure the error as the number of voxels that are incorrectly assigned due to slicing. We provide an algorithm that generates, for a given set of available slice heights and a shape, a slicing that is provably optimal. By optimal, we mean that the algorithm generates sequences with minimal error for any possible number of slices. The algorithm is fast and flexible, that is, it can accommodate a user driven importance modulation of the error function and allows the interactive exploration of the desired quality/time tradeoff. We demonstrate the practical importance of our optimization on several three-dimensional-printed results.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85294432","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}
引用次数: 7
Antialiasing complex global illumination effects in path-space 路径空间中复杂全局照明效果的抗混叠
ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126812
Laurent Belcour, Ling-Qi Yan, R. Ramamoorthi, D. Nowrouzezahrai
{"title":"Antialiasing complex global illumination effects in path-space","authors":"Laurent Belcour, Ling-Qi Yan, R. Ramamoorthi, D. Nowrouzezahrai","doi":"10.1145/3072959.3126812","DOIUrl":"https://doi.org/10.1145/3072959.3126812","url":null,"abstract":"We present the first method to efficiently predict antialiasing footprints to pre-filter color-, normal-, and displacement-mapped appearance in the context of multi-bounce global illumination. We derive Fourier spectra for radiance and importance functions that allow us to compute spatial-angular filtering footprints at path vertices for both uni- and bi-directional path construction. We then use these footprints to antialias reflectance modulated by high-resolution maps (such as color and normal maps) encountered along a path. In doing so, we also unify the traditional path-space formulation of light transport with our frequency-space interpretation of global illumination pre-filtering. Our method is fully compatible with all existing single bounce pre-filtering appearance models, not restricted by path length, and easy to implement atop existing path-space renderers. We illustrate its effectiveness on several radiometrically complex scenarios where previous approaches either completely fail or require orders of magnitude more time to arrive at similarly high-quality results.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91246262","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}
引用次数: 3
A spatial target function for metropolis photon tracing 大都市光子跟踪的空间目标函数
ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126811
Adrien Gruson, Mickaël Ribardière, M. Sik, J. Vorba, R. Cozot, K. Bouatouch, Jaroslav Křivánek
{"title":"A spatial target function for metropolis photon tracing","authors":"Adrien Gruson, Mickaël Ribardière, M. Sik, J. Vorba, R. Cozot, K. Bouatouch, Jaroslav Křivánek","doi":"10.1145/3072959.3126811","DOIUrl":"https://doi.org/10.1145/3072959.3126811","url":null,"abstract":"The human visual system is sensitive to relative differences in luminance, but light transport simulation algorithms based on Metropolis sampling often result in a highly nonuniform relative error distribution over the rendered image. Although this issue has previously been addressed in the context of the Metropolis light transport algorithm, our work focuses on Metropolis photon tracing. We present a new target function (TF) for Metropolis photon tracing that ensures good stratification of photons leading to pixel estimates with equalized relative error. We develop a hierarchical scheme for progressive construction of the TF from paths sampled during rendering. In addition to the approach taken in previous work, where the TF is defined in the image plane, ours can be associated with compact spatial regions. This allows us to take advantage of illumination coherence to more robustly estimate the TF while adapting to geometry discontinuities. To sample from this TF, we design a new replica exchange Metropolis scheme. We apply our algorithm in progressive photon mapping and show that it often outperforms alternative approaches in terms of image quality by a large margin.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89904418","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信