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...

We consider the problem of discovering a smooth unknown surface S bounding an object O in R. The discovery process consists of moving a point probing device in the free space around O so that it repeatedly comes in contact with S. We propose a probing strategy for generating a sequence of surface samples on S from which a triangulated surface can be generated that approximates S within any desi...

Lin and Chang gave a generating function of convex polyominoes with an m+1 by n + 1 minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is m+ n+mn m+ n ( 2m+ 2n 2m ) − 2mn m+ n ( m+ n m )2 . We show that this result can be derived from some binomial coefficients identities related to the generating function of Jacobi polynomials. Some (binomia...

Space-filling curves can be used to organise points in the plane into bounding-box hierarchies (such as R-trees). We develop measures of the bounding-box quality of space-filling curves that express how effective different space-filling curves are for this purpose. We give general lower bounds on the bounding-box quality measures and on locality according to Gotsman and Lindenbaum for a large c...

We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product surface groups. This allows us detect non-trivial obstruction bounding from below effective topological complexity an orientable with respect its antipodal involution. Our estimates are at most one unit being optimal, and closely related (regular) non-orientable surfaces.

Bounding boxes are used in many applications for simplification of point sets or complex shapes. For example, in computer graphics, bounding boxes are used to maintain hierarchical data structures for fast rendering of a scene or for collision detection. Additional applications include those in shape analysis and shape simplification, or in statistics, for storing and performing range-search qu...

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.