When designing games, artists exert large efforts to create visually compelling scenes. Work such as WordsEye [Coyne and Sproat 2001] can assist artists by parsing natural language texts into static scenes. Complementary to this endeavour is the population of that environment by simulation authors. Adding agents to an environment with plausible behaviors is a time consuming process, as most require individual scripts to control their behavior. This generally degrades variability, as scripts are re-used. In order to assist in creating commands and scenes for virtual actors, we propose a method that can create scripts for agents to plausibly act within a virtual environment. This work is inspired by [Ma 2006], which provides an action to a virtual agent from a single sentence. However, our method works for several agents over longer periods of time.
在设计游戏时，美术人员会付出很大的努力去创造视觉上引人注目的场景。像WordsEye [Coyne and spproat 2001]这样的工作可以通过将自然语言文本解析为静态场景来帮助艺术家。与这种努力相辅相成的是模拟作者对该环境的填充。向具有合理行为的环境中添加代理是一个耗时的过程，因为大多数代理都需要单独的脚本来控制它们的行为。这通常会降低可变性，因为脚本会被重用。为了帮助为虚拟演员创建命令和场景，我们提出了一种方法，可以为代理创建脚本，使其在虚拟环境中合理地行动。这项工作受到[Ma 2006]的启发，它从一个句子中向虚拟代理提供一个动作。然而，我们的方法在较长时间内适用于多个代理。
{"title":"Agent script generation using descriptive text documents","authors":"J. Balint, Y. Gingold, J. Allbeck","doi":"10.1145/2668064.2677076","DOIUrl":"https://doi.org/10.1145/2668064.2677076","url":null,"abstract":"When designing games, artists exert large efforts to create visually compelling scenes. Work such as WordsEye [Coyne and Sproat 2001] can assist artists by parsing natural language texts into static scenes. Complementary to this endeavour is the population of that environment by simulation authors. Adding agents to an environment with plausible behaviors is a time consuming process, as most require individual scripts to control their behavior. This generally degrades variability, as scripts are re-used. In order to assist in creating commands and scenes for virtual actors, we propose a method that can create scripts for agents to plausibly act within a virtual environment. This work is inspired by [Ma 2006], which provides an action to a virtual agent from a single sentence. However, our method works for several agents over longer periods of time.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016327","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}
Jose Guillermo Rangel Ramirez, Devin Lange, Panayiotis Charalambous, Claudia Esteves, J. Pettré
Over the past few years, simulating crowds in virtual environments has become an important tool to give life to virtual scenes; be it movies, games, training applications, etc. An important part of crowd simulation is the way that people move from one place to another. This paper concentrates on improving the crowd patches approach proposed by Yersin et al. [Yersin et al. 2009] that aims on efficiently animating ambient crowds in a scene. This method is based on the construction of animation blocks (called patches) concatenated together under some constraints to create larger and richer animations with limited run-time cost. Specifically, an optimization based approach to generate smooth collision free trajectories for crowd patches is proposed. The contributions of this work to the crowd patches framework are threefold; firstly a method to match the end points of trajectories based on the Gale-Shapley algorithm [Gale and Shapley 1962] is proposed that takes into account preferred velocities and space coverage, secondly an improved algorithm for collision avoidance is proposed that gives natural appearance to trajectories and finally a cubic spline approach is used to smooth out generated trajectories. We demonstrate several examples of patches and how they were improved by the proposed method, some limitations and directions for future improvements.
在过去的几年里，模拟虚拟环境中的人群已经成为赋予虚拟场景生命的重要工具;无论是电影、游戏、培训应用程序等等。人群模拟的一个重要部分是人们从一个地方移动到另一个地方的方式。本文专注于改进Yersin等人提出的人群补丁方法[Yersin et al. 2009]，该方法旨在有效地使场景中的环境人群动画化。这种方法是基于动画块(称为patch)的构建，在一定的约束下连接在一起，以有限的运行时间成本创建更大更丰富的动画。具体而言，提出了一种基于优化的方法来生成人群补丁的光滑无碰撞轨迹。这项工作对人群补丁框架的贡献有三个方面;首先提出了一种基于Gale-Shapley算法[Gale and Shapley 1962]的匹配轨迹端点的方法，该方法考虑了首选速度和空间覆盖，其次提出了一种改进的避撞算法，该算法使轨迹具有自然外观，最后使用三次样条方法对生成的轨迹进行平滑处理。我们展示了几个补丁的例子，以及如何通过所提出的方法改进它们，一些限制和未来改进的方向。
{"title":"Optimization-based computation of locomotion trajectories for crowd patches","authors":"Jose Guillermo Rangel Ramirez, Devin Lange, Panayiotis Charalambous, Claudia Esteves, J. Pettré","doi":"10.1145/2668064.2668094","DOIUrl":"https://doi.org/10.1145/2668064.2668094","url":null,"abstract":"Over the past few years, simulating crowds in virtual environments has become an important tool to give life to virtual scenes; be it movies, games, training applications, etc. An important part of crowd simulation is the way that people move from one place to another. This paper concentrates on improving the crowd patches approach proposed by Yersin et al. [Yersin et al. 2009] that aims on efficiently animating ambient crowds in a scene. This method is based on the construction of animation blocks (called patches) concatenated together under some constraints to create larger and richer animations with limited run-time cost. Specifically, an optimization based approach to generate smooth collision free trajectories for crowd patches is proposed. The contributions of this work to the crowd patches framework are threefold; firstly a method to match the end points of trajectories based on the Gale-Shapley algorithm [Gale and Shapley 1962] is proposed that takes into account preferred velocities and space coverage, secondly an improved algorithm for collision avoidance is proposed that gives natural appearance to trajectories and finally a cubic spline approach is used to smooth out generated trajectories. We demonstrate several examples of patches and how they were improved by the proposed method, some limitations and directions for future improvements.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933539","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}
Andrew W. Feng, Gale M. Lucas, S. Marsella, Evan A. Suma, C. Chiu, D. Casas, Ari Shapiro
Recent advances in scanning technology have enabled the widespread capture of 3D character models based on human subjects. However, in order to generate a recognizable 3D avatar, the movement and behavior of the human subject should be captured and replicated as well. We present a method of generating a 3D model from a scan, as well as a method to incorporate a subjects style of gesturing into a 3D character. We present a study which shows that 3D characters that used the gestural style as their original human subjects were more recognizable as the original subject than those that don't.
{"title":"Acting the part: the role of gesture on avatar identity","authors":"Andrew W. Feng, Gale M. Lucas, S. Marsella, Evan A. Suma, C. Chiu, D. Casas, Ari Shapiro","doi":"10.1145/2668064.2668102","DOIUrl":"https://doi.org/10.1145/2668064.2668102","url":null,"abstract":"Recent advances in scanning technology have enabled the widespread capture of 3D character models based on human subjects. However, in order to generate a recognizable 3D avatar, the movement and behavior of the human subject should be captured and replicated as well. We present a method of generating a 3D model from a scan, as well as a method to incorporate a subjects style of gesturing into a 3D character. We present a study which shows that 3D characters that used the gestural style as their original human subjects were more recognizable as the original subject than those that don't.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124608281","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}
We present in this paper a new GPU-based approach to compute Shortest Path Maps (SPMs) from a source point in a polygonal domain. Our method takes advantage of GPU polygon rasterization with shader programming. After encoding the SPM in the frame buffer, globally shortest paths are efficiently computed in time proportional to the number of vertices in the path, and length queries are computed in constant time. We have evaluated our method in multiple environments and our results show a significant speedup in comparison to previous approaches.
{"title":"Computing shortest path maps with GPU shaders","authors":"C. Camporesi, Marcelo Kallmann","doi":"10.1145/2668064.2668092","DOIUrl":"https://doi.org/10.1145/2668064.2668092","url":null,"abstract":"We present in this paper a new GPU-based approach to compute Shortest Path Maps (SPMs) from a source point in a polygonal domain. Our method takes advantage of GPU polygon rasterization with shader programming. After encoding the SPM in the frame buffer, globally shortest paths are efficiently computed in time proportional to the number of vertices in the path, and length queries are computed in constant time. We have evaluated our method in multiple environments and our results show a significant speedup in comparison to previous approaches.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129073537","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}
The Weighted Region Problem is defined as the problem of finding a cost-optimal path in a weighted planar polygonal subdivision. Searching for paths on a grid representation of the scene is fast and easy to implement. However, grid representations do not capture the exact geometry of the scene. Hence, grid paths can be inaccurate or might not even exist at all. Methods that work on an exact representation of the scene can approximate an optimal path up to an arbitrarily small ε-error. However, these methods are computationally inefficient and thus not well-suited for real-time applications. In this paper, we analyze the quality of optimal paths on a 8-neighbor-grid. We prove that the costs of such a path in a scene with weighted regions can be arbitrarily high in the general case. If all regions are aligned with the grid, we prove that the costs are at most (4+[EQUATION]) times the costs of an optimal path. In addition, we present a new hybrid method called Vertex-based Pruning (VBP). VBP computes paths that are ε-optimal inside a pruned subset of the scene. Experiments show that VBP paths can be computed at interactive rates, and are thus well-suited as an input for advanced path-following strategies in robotics, crowd simulation or gaming applications.
{"title":"Computing high-quality paths in weighted regions","authors":"N. Jaklin, M. Tibboel, Roland Geraerts","doi":"10.1145/2668064.2668097","DOIUrl":"https://doi.org/10.1145/2668064.2668097","url":null,"abstract":"The Weighted Region Problem is defined as the problem of finding a cost-optimal path in a weighted planar polygonal subdivision. Searching for paths on a grid representation of the scene is fast and easy to implement. However, grid representations do not capture the exact geometry of the scene. Hence, grid paths can be inaccurate or might not even exist at all. Methods that work on an exact representation of the scene can approximate an optimal path up to an arbitrarily small ε-error. However, these methods are computationally inefficient and thus not well-suited for real-time applications. In this paper, we analyze the quality of optimal paths on a 8-neighbor-grid. We prove that the costs of such a path in a scene with weighted regions can be arbitrarily high in the general case. If all regions are aligned with the grid, we prove that the costs are at most (4+[EQUATION]) times the costs of an optimal path. In addition, we present a new hybrid method called Vertex-based Pruning (VBP). VBP computes paths that are ε-optimal inside a pruned subset of the scene. Experiments show that VBP paths can be computed at interactive rates, and are thus well-suited as an input for advanced path-following strategies in robotics, crowd simulation or gaming applications.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668542","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}
Viewers effortlessly decouple action from style for human motion. Regardless of whether style refers to the subtle differences between individuals (John Wayne's walk versus Charlie Chaplin's walk) or to the manner in which the same action is expressed (such as a sad walk versus a nervous walk), the core intent of an action is readily recognizable.
{"title":"How do stylistic motions differ numerically from neutral ones?","authors":"Aline Normoyle, N. Badler","doi":"10.1145/2668064.2677080","DOIUrl":"https://doi.org/10.1145/2668064.2677080","url":null,"abstract":"Viewers effortlessly decouple action from style for human motion. Regardless of whether style refers to the subtle differences between individuals (John Wayne's walk versus Charlie Chaplin's walk) or to the manner in which the same action is expressed (such as a sad walk versus a nervous walk), the core intent of an action is readily recognizable.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126041482","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}
Powerful graphic cards have enabled the game engine developers to add deformable assets. Many games require the players to cut/chop/slash game assets. To render interaction of deformable assets with sharp weapons they use pre-defined fracture patterns. These pre-defined fracture patterns are used to break/cut objects and the use of physics is limited due to computational costs of the virtual cutting process. In this work, we present a low cost solution for performing physics based virtual cutting on deformable assets. Our aim is to provide a highly tunable physics based virtual cutting algorithm on GPU to meet the varying needs of a game engine.
{"title":"Physics based virtual cutting using j-integral method for gaming applications","authors":"P. Shrivastava, Sukhendu Das","doi":"10.1145/2668064.2677078","DOIUrl":"https://doi.org/10.1145/2668064.2677078","url":null,"abstract":"Powerful graphic cards have enabled the game engine developers to add deformable assets. Many games require the players to cut/chop/slash game assets. To render interaction of deformable assets with sharp weapons they use pre-defined fracture patterns. These pre-defined fracture patterns are used to break/cut objects and the use of physics is limited due to computational costs of the virtual cutting process. In this work, we present a low cost solution for performing physics based virtual cutting on deformable assets. Our aim is to provide a highly tunable physics based virtual cutting algorithm on GPU to meet the varying needs of a game engine.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132301722","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}
The Seventh International Conference on Motion in Games (MIG) is being held at the University of Southern California's Institute for Creative Technologies in Los Angeles, California, USA from November 6-8, 2014. MIG 2014 is sponsored by ACM SIGGRAPH, with papers appearing in the ACM digital library. Games have become a very important medium for both education and entertainment. Motion plays a critical role in computer games. Characters move around, objects are manipulated or move due to physical constraints, entities are animated, and the camera moves through the scene. Even the motion of the player nowadays is used as input to games. Motion is currently studied in many different areas of research, including graphics and animation, game technology, robotics, simulation, computer vision and also physics, psychology, and urban studies. Cross-fertilization between these communities can considerably advance the state of the art in this area. The goal of the Motion in Games conference is to bring together researchers from these various fields to present the most recent results and to initiate collaboration.
第七届国际游戏动态会议(MIG)将于2014年11月6日至8日在美国加州洛杉矶的南加州大学创意技术学院举行。MIG 2014由ACM SIGGRAPH主办，论文发表在ACM数字图书馆。游戏已经成为教育和娱乐的重要媒介。动作在电脑游戏中起着至关重要的作用。角色四处移动，物体被操纵或由于物理限制而移动，实体被动画化，摄像机在场景中移动。现在甚至玩家的动作也被用作游戏的输入。运动目前在许多不同的研究领域进行研究，包括图形和动画，游戏技术，机器人技术，仿真，计算机视觉以及物理学，心理学和城市研究。这些社区之间的交叉受精可以大大提高这一领域的技术水平。Motion in Games会议的目标是将这些不同领域的研究人员聚集在一起，展示最新的研究成果并启动合作。
{"title":"Proceedings of the 7th International Conference on Motion in Games","authors":"Ari Shapiro, N. Amato, J. Hodgins","doi":"10.1145/2668064","DOIUrl":"https://doi.org/10.1145/2668064","url":null,"abstract":"The Seventh International Conference on Motion in Games (MIG) is being held at the University of Southern California's Institute for Creative Technologies in Los Angeles, California, USA from November 6-8, 2014. MIG 2014 is sponsored by ACM SIGGRAPH, with papers appearing in the ACM digital library. \u0000 \u0000Games have become a very important medium for both education and entertainment. Motion plays a critical role in computer games. Characters move around, objects are manipulated or move due to physical constraints, entities are animated, and the camera moves through the scene. Even the motion of the player nowadays is used as input to games. Motion is currently studied in many different areas of research, including graphics and animation, game technology, robotics, simulation, computer vision and also physics, psychology, and urban studies. Cross-fertilization between these communities can considerably advance the state of the art in this area. The goal of the Motion in Games conference is to bring together researchers from these various fields to present the most recent results and to initiate collaboration.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133846318","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}
Real-time animation controllers are fundamental for animating characters in response to player input. However, the design of such controllers requires making trade-offs between the naturalness of the character's motions and the promptness of the character's response. In this paper, we investigate the effects of such tradeoffs on the players' enjoyment, control, satisfaction, and opinion of the character in a simple platform game. In our first experiment, we compare three controllers having the same responsiveness, but varying levels of naturalness. In the second experiment, we compare three controllers having increasing realism but at the expense of decreased responsiveness. Not surprisingly, our least responsive controller negatively affects players' performance and perceived ability to control the character. However, we also find that players are most satisfied with their own performance using our least natural controller, in which the character moves around the environment in a static pose; that differences in animation can significantly alter players' enjoyment with responsiveness being equal; and that players do not report increased motion quality with our most natural controller, despite viewers outside of a game context rating the same controller as significantly more natural than our other conditions.
{"title":"Trade-offs between responsiveness and naturalness for player characters","authors":"Aline Normoyle, S. Jörg","doi":"10.1145/2668064.2668087","DOIUrl":"https://doi.org/10.1145/2668064.2668087","url":null,"abstract":"Real-time animation controllers are fundamental for animating characters in response to player input. However, the design of such controllers requires making trade-offs between the naturalness of the character's motions and the promptness of the character's response. In this paper, we investigate the effects of such tradeoffs on the players' enjoyment, control, satisfaction, and opinion of the character in a simple platform game. In our first experiment, we compare three controllers having the same responsiveness, but varying levels of naturalness. In the second experiment, we compare three controllers having increasing realism but at the expense of decreased responsiveness. Not surprisingly, our least responsive controller negatively affects players' performance and perceived ability to control the character. However, we also find that players are most satisfied with their own performance using our least natural controller, in which the character moves around the environment in a static pose; that differences in animation can significantly alter players' enjoyment with responsiveness being equal; and that players do not report increased motion quality with our most natural controller, despite viewers outside of a game context rating the same controller as significantly more natural than our other conditions.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116680430","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}
Alain Juarez-Perez, Andrew W. Feng, Marcelo Kallmann, Ari Shapiro
We present preliminary results of a framework that can synthesize parameterized locomotion with controllable quality from simple deformations over a single step cycle. Our approach enforces feet constraints per phase in order to appropriately perform motion deformation operations, resulting in a generative and controllable model that maintains the style of the input motion. The method is lightweight and has quantifiable motion quality related to the amount of deformation used. It only requires a single cycle of locomotion. An analysis of the deformation is presented with the quantification of the valid portion of the deformed motion space, informing on the parameterization coverage of the deformable motion cycle.
{"title":"Deformation, parameterization and analysis of a single locomotion cycle","authors":"Alain Juarez-Perez, Andrew W. Feng, Marcelo Kallmann, Ari Shapiro","doi":"10.1145/2668064.2677082","DOIUrl":"https://doi.org/10.1145/2668064.2677082","url":null,"abstract":"We present preliminary results of a framework that can synthesize parameterized locomotion with controllable quality from simple deformations over a single step cycle. Our approach enforces feet constraints per phase in order to appropriately perform motion deformation operations, resulting in a generative and controllable model that maintains the style of the input motion. The method is lightweight and has quantifiable motion quality related to the amount of deformation used. It only requires a single cycle of locomotion. An analysis of the deformation is presented with the quantification of the valid portion of the deformed motion space, informing on the parameterization coverage of the deformable motion cycle.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114521099","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：