We present a novel and fast algorithm to compute penetration depth (PD) between two polyhedral models. Given two overlapping polyhedra, it computes the minimal translation distance to separate them using a combination of object-space and image-space techniques. The algorithm computes pairwise Minkowski sums of decomposed convex pieces, performs closest-point query using rasterization hardware a...

The generation and visualisation of moving virtual objects is of particular concern in computer graphics. Most notably, the animation of deforming models is complex depending on mechanical properties and the variability of the geometry. Purely geometric methods are, to some extend, sufficient to compute natural movements and deformations of a body. In other cases, a physics-based simulation is ...

We present data structures and algorithms for dynamic collision detection in virtual reality (VR) applications. The methods are applicable to all general polygonal models. They combine the advantages of collision detection using bounding volume (BV) hierarchies with the ability to compute dynamic collision detection results. The results are used as input for further simulations, e.g. contact or...

Sensing devices generate tremendous amounts of data each day, which include large quantities of multi-dimensional measurements. These data are expected to be immediately available for real-time analytics as they are streamed into storage. Such scenarios pose challenges to state-of-the-art indexing methods, as they must not only support efficient queries but also frequent updates. We propose her...

In the present paper we study the learnability of enumerable families L of uniformly recursive languages in dependence on the number of allowed mind changes, i.e., with respect to a well{studied measure of e ciency. We distinguish between exact learnability (L has to be inferred w.r.t. L) and class preserving learning (L has to be inferred w.r.t. some suitable chosen enumeration of all the lang...

A novel method for automatic registration based on Iterative Closest Point (ICP) approach is proposed. This method uses geometric bounding containers to evaluate the optimum overlap rate of the data and model point sets.

Interactive environments for dynamically deforming objects play an important role in surgery simulation and entertainment technology. These environments require fast deformable models and very efficient collision handling techniques. While collision detection for rigid bodies is well-investigated, collision detection for deformable objects introduces additional challenging problems. This paper ...

In this paper, we introduce an interactive method suitable for retargeting both 3D objects and scenes. Initially, the input object or scene is decomposed into a collection of constituent components enclosed by corresponding control bounding volumes which capture the intra-structures of the object or semantic grouping of objects in the 3D scene. The overall retargeting is accomplished through a ...

In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated with over approximation of contact information for time-critical collision detection schemes that utilise sphere-tree bounding volume hierarchies. Existing solutions to time-critical collision handling can at times suffe...

While volume rendering is becoming more widely used in medical applications, it is still difficult to generate a good quality image interactively without expensive hardware when the size of the dataset is quite large. For interactive rendering of a large dataset, we present an acceleration method, image-space bounding surface. Using an image-space bounding surface, the isosurface ray casting is...