Simulating sounds produced by realistic vibrating objects is challenging because sound radiation involves complex diffraction and interreflection effects that are very perceptible and important. These wave phenomena are well understood, but have been largely ignored in computer graphics due to the high cost and complexity of computing them at audio rates.

cost of geometrical calculations still appears to overshadow their potential benefits. This paper presents solutions to integrate off-line geometrical acoustic modeling in game environments. By pre-computing image-source gradients for early reflections and directional decay profiles, we can generate

After presenting the mathematical background of modelling elastic deformations together with finite element formulation, we propose a new algorithm allowing haptic interaction with soft tissues having both non-linear geometric and physical properties. The algorithm consists of two phases — first

Abstract — To solve complex whole-body motion planning problems in near real-time, we think it essentials to precompute as much information as possible, including our intended move-ments and how they affect the geometrical reasoning process. In this paper, we focus on the precomputation

In this paper, we consider Dijkstra's algorithm for the single source single target shortest paths problem in large sparse graphs. The goal is to reduce the response time for online queries by using precomputed information. For the result of the preprocessing, we admit at most linear space

In this paper, we consider Dijkstra's algorithm for the single source single target shortest path problem in large sparse graphs. The goal is to reduce the response time for on-line queries by using precomputed information. Due to the size of the graph, preprocessing space requirements can

by Baker et al. for the direct estimation of groupwise geometric transformations. It is efficient in that it performs several computationally expensive calculations at a precomputation phase. Photometric transformations act on the value of the pixels. They account for effects such as lighting change

This paper describes a nev probabilistic roadmap (PRM) path planner that is: (1) single-query instead of pre-computing a roadmap covering the entire free space, it uses the tvo input query configurations as seeds to explore as little space as possible; (2) hi-directional it explores the robotis

coordinate system. This is problematic for the geometric hashing method, because it means that the precomputed lookup table used by that method is not correct when there is positional uncertainty in the sensor data. We analyze the effect that this has on the probability that the geometric hashing method

for objects with complex geome-try. We exploit the fact that model reduction on large deforma-tion models with linear materials (as commonly used in graphics) result in internal force models that are simply cubic polynomials in reduced coordinates. Coefficients of these polynomials can be precomputed