This paper introduces a tactile rendering algorithm for wearable cutaneous devices that stimulate the skin through local contact surface modulation. The first step in the algorithm simulates contact between a skin model and virtual objects, and computes the contact surface to be rendered. The accuracy of this surface is maximized by simulating soft skin with its characteristic nonlinear behavior. The second step takes the desired contact surface as input, and computes the device configuration by solving an optimization problem, i.e., minimizing the deviation between the contact surface in the virtual environment and the contact surface rendered by the device. The method is implemented on a thimble-like wearable device.

The command of haptic devices for rendering direct interaction with the hand requires thorough knowledge of the forces and deformations caused by contact interactions on the fingers. In this paper, we propose an algorithm to simulate nonlinear elasticity under frictional contact, with the goal of establishing a model-based strategy to command haptic devices and to render direct hand interaction. The key novelty in our algorithm is an approach to model the extremely nonlinear elasticity of finger skin and flesh using strain-limiting constraints, which are seamlessly combined with frictional contact constraints in a standard constrained dynamics solver. We show that our approach enables haptic rendering of rich and compelling deformations of the fingertip.

Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for triangle meshes, however, such hierarchical data structures lose much of their power, because triangles adjacent to each other cannot be distinguished from actually colliding ones unless individually tested. Shape regularity of surface patches, described in terms of orientation and contour conditions, was proposed long ago as a culling criterion for hierarchical self-collision detection. However, to date, algorithms based on shape regularity had to trade conservativeness for efficiency, because there was no known algorithm for efficiently performing 2D contour self-intersection tests. In this paper, we introduce a star-contour criterion that is amenable to hierarchical computations. Together with a thorough analysis of the tree traversal process in hierarchical self-collision detection, it has led us to novel hierarchical data structures and algorithms for efficient yet conservative self-collision detection. We demonstrate the application of our algorithm to several example animations, and we show that it consistently outperforms other approaches.