Computer Animation and Virtual Worlds

Cover image for Vol. 23 Issue 5

September/October 2012

Volume 23, Issue 5

Pages i–ii, 467–532

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Research Articles
    1. ISSUE INFORMATION (pages i–ii)

      Article first published online: 15 OCT 2012 | DOI: 10.1002/cav.1492

  2. Editorial

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Research Articles
    1. Editorial Issue 23.5 (page 467)

      Nadia Magnenat-Thalmann and Daniel Thalmann

      Article first published online: 15 OCT 2012 | DOI: 10.1002/cav.1490

  3. Research Articles

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Research Articles
    1. Human motion retrieval using topic model (pages 469–476)

      Mingyang Zhu, Huaijiang Sun, Rongyi Lan and Bin Li

      Article first published online: 4 OCT 2011 | DOI: 10.1002/cav.432

      Thumbnail image of graphical abstract

      In this work, we show an unsupervised method to extract a latent semantic layer based on geometric features, which provides a new way to represent and understand human motion capture data. This new semantic layer is composed by the combination patterns of mo-words which frequently apper in motions.

    2. Particle-based simulation of bubbles in water–solid interaction (pages 477–487)

      Xuqiang Shao, Zhong Zhou and Wei Wu

      Article first published online: 28 FEB 2012 | DOI: 10.1002/cav.438

      Thumbnail image of graphical abstract

      We propose an approximate mode for the generation of bubbles in water–solid interaction on the fly, which takes into account the influence of gas concentration, solid material, and water–solid velocity difference. As the surface air particle of bubbles is treated as a virtual nucleation site, bubbles absorb air from water and grow. The two-way coupling of bubbles with water and solid is calculated by a drag force, so the bubbles’ flow on the solid surface and deformation in the movement process can be simulated.

    3. Real-time cutting simulation of meshless deformable object using dynamic bounding volume hierarchy (pages 489–501)

      Hoeryong Jung and Doo Yong Lee

      Article first published online: 5 OCT 2012 | DOI: 10.1002/cav.1485

      Thumbnail image of graphical abstract

      This paper proposes a novel method for a real-time cutting simulation of deformable objects using meshless method. Topological relations among simulation nodes are defined as an undirected graph and refined by removing the edges of the graph that is intersected by the cut surface. Our approach utilizes a bounding volume hierarchy (BVH) to accelerate the computation of the intersection test and provides efficient reconstruction algorithm on the basis of the two-level BVH structure.

    4. A new marker design for a robust marker tracking system against occlusions (pages 503–518)

      Hugo Álvarez, Ibai Leizea and Diego Borro

      Article first published online: 8 OCT 2012 | DOI: 10.1002/cav.1487

      Thumbnail image of graphical abstract

      This paper proposes a new marker design for the treatment of occlusions. It uses customizable textures that let users design their own markers or expand the marketing opportunities of the companies. Moreover, multiple tracking techniques are combined and executed in real time in order to achieve a robust and fast tracking. Additionally, the new marker design offers new interaction possibilities that can be used to develop new applications.

    5. Volumetric subspace mesh deformation with structure preservation (pages 519–532)

      Yong Zhao and Jianhui Liu

      Article first published online: 20 SEP 2012 | DOI: 10.1002/cav.1488

      Thumbnail image of graphical abstract

      Existing deformation techniques are oblivious to salient structures that often capture the essence of 3D meshes. Combining with gradient domain technique, we propose an alternative approach to preserve these structures in the volumetric subspace. Massive experimental data demonstrate the effectiveness and efficiency of our algorithm.

SEARCH

SEARCH BY CITATION