PG2015short

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/13267

Browse

Browsing PG2015short by Subject "Animation"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Accelerating Graph-based Path Planning Through Waypoint Clustering
    (The Eurographics Association, 2015) Wardhana, Nicholas Mario; Johan, Henry; Seah, Hock-Soon; Stam, Jos and Mitra, Niloy J. and Xu, Kun
    Modern Computer Graphics applications commonly feature very large virtual environments and diverse characters which perform different kinds of motions. To accelerate path planning in such scenario, we propose subregion graph data structure. It consists of subregions, which are clusters of locally connected waypoints inside a region, as well as their connectivities. We also present a fast algorithm to automatically generate subregion graph from enhanced waypoint graph map representation, which also supports various motion types and can be created from large virtual environments. Nevertheless, subregion graph can also be generated from any graph-based map representation. Our experiments showed that subregion graph is very compact relative to the input waypoint graph. By firstly planning subregion path, and then limiting waypoint-level planning to the subregion path, up to 8 times average speedup can be achieved, while average length ratios are maintained at as low as 102.5%.
  • Thumbnail Image
    Item
    Adaptive Hierarchical Shape Matching
    (The Eurographics Association, 2015) Tian, Yuan; Yang, Yin; Guo, Xiaohu; Prabhakaran, Balakrishnan; Stam, Jos and Mitra, Niloy J. and Xu, Kun
    In this paper, we present an adaptive hierarchical method allowing users to interact with geometrically complex 3D deformable objects based on an extended shape matching approach. Our method extends the existing multiresolution shape matching methods with improved energy convergence rate. This is achieved by using adaptive integration strategies to avoid insignificant shape matching iterations during the simulation. As demonstrated in our experimental results, the proposed method provides an efficient yet stable deformable simulation of complex models in real-time.
  • Thumbnail Image
    Item
    Modal Space Subdivision for Physically-plausible 4D Shape Sequence Completion from Sparse Samples
    (The Eurographics Association, 2015) Xia, Qing; Li, Shuai; Qin, Hong; Hao, Aimin; Stam, Jos and Mitra, Niloy J. and Xu, Kun
    Subdivision techniques are powerful and ubiquitous in generating smooth surfaces from coarse 3D polygonal models, yet space-time subdivision remains unexplored when the goal is to produce dense physically-realistic shape sequence with smooth transition from a set of sparse 3D model samples. In this paper, we considers a completely data-driven strategy and proposes a novel modal space subdivision scheme to facilitate the rapid generation of physically-plausible "in-between" shapes from sparse model samples. The key idea of our approach is to abstract any shape as a point in modal space, represent its potential deformation with shape modes, and iteratively seek all the intermediate shapes between two consecutive models in the modal space via recursive subdivision. Meanwhile, to guarantee deformation details, we further interpolate the shape in the local regions after global modal-space subdivision. Comprehensive experiments on various model inputs have demonstrated the power, versatility, high performance, and potential of our modal space subdivision scheme.