The tightness of the bounding volume is often difficult to adjust to suit different applications. In this paper, we present a technique to derive a tunable bounding volume for elliptic paraboloids, where the tightness can easily be controlled and altered at several levels. Our technique develops such a tunable bounding volume through the optimization process. Bounding volumes thus developed con...

Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in Rd . The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimum-volume bounding boxes. In this paper we give a lower bound on the approximation factor of PCA bounding boxes of convex polytopes in arbitrar...

A new method of word segmentation for document images is presented. The method uses the bounding box regions to enclose the letters (characters) of the words and then the resulting letter spaces are progressively filled to merge the character bounding boxes to get the word bounding boxes. The method holds good for inclined and irregularly distributed words. The proposed method completely avoids...

The area covered by a three-dimensional bounding box after projection onto the screen is relevant for view-dependent algorithms in real-time and photorealistic rendering. We describe a fast method to compute the accurate two-dimensional area of a three-dimensional oriented bounding box, and show how it can be computed equally fast or faster than its approximation with a two-dimensional bounding...

In the animation of deformable objects, collision detection is crucial for the performance. Contrary to volumetric bodies, the accuracy requirements for the collision treatment of textiles are particularly strict because any overlapping is visible. Therefore, we apply methods specifically designed for deformable surfaces that speed up the collision detection. In this paper the efficiency of bou...

Recently, Guibas et al. 10 studied deformable necklaces – flexible chains of balls, called beads, in which only adjacent balls can intersect. In this paper, we investigate the problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with n beads in R by k cylinders can be computed in pol...

We propose a novel adaptive pipeline for continuous collision detection in cloth simulation. The pipeline consists of four components: bounding volume hierarchy (BVH) update, BVH traversal, a skipping frame session, and elementary test processing. The skipping frame session is activated adaptively for skipping both BVH update and BVH traversal during the process of collision detection. The prop...

Aiming at developing a simple and efficient collision detection method to support the wandering in equipment deploy scene in land reclamation area of mining dump. This paper presents an efficient algorithm for collision detection in the waste dump land reclamation equipment deploy scene using a bounding volume nestification which consists of an oriented bounding boxes (OBBs) enhanced with axial...

We study the practicability and performance of different classes of bounding volume hierarchies for self collision detection in complex human hair styles with authentic geometrical properties. In particular, we focus on topology based hierarchies which allow for fast update schemes as well as conventional spatially adapted hierarchies. In this context, we introduce a parameterized k-DOP approac...