We propose an acceleration scheme for many-body dynamic collision detection at interactive rates. We use the Velocity-Aligned Discrete Oriented Polytope (VADOP), a tight bounding volume representation that offers fast update rates and which is particularly suitable for applications with many fast-moving objects. The axes selection that determines the shape of our bounding volumes is based on spherical coverings. We demonstrate that we can robustly detect collisions that are missed by pseudodynamic collision detection schemes with even greater performance due to substantial collision pruning by our bounding volumes.

Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

Multi-functional geometric data structures

Compact surface descriptions like higher-order surfaces are popular representations for both modeling and animation. However, for fast graphics-hardware-assisted rendering, they usually need to be converted to triangle meshes. In this paper, we introduce a new framework for performing on-the-fly crack-free adaptive tessellation of surface primitives completely on the GPU. Utilizing CUDA and its flexible memory write capabilities, we parallelize the tessellation task at the level of single surface primitives. We are hence able to derive tessellation factors, perform surface evaluation as well as generate the tessellation topology in real-time even for large collections of primitives. We demonstrate the power of our framework by exemplarily applying it to both bicubic rational Bezier patches and PN triangles.

/pdf/fast-gpu-based-adaptive-tessellation-with-cuda-1s1lij95s6.pdf

Fast GPU-based Adaptive Tessellation with CUDA

An extended subdivision surface (ESub) is a generalization of Catmull Clark and NURBS surfaces. Depending on the knot intervals and valences of the vertices and faces, Catmull Clark as well as NURBS patches can be generated using the extended subdivision rules. Moreover, an arbitrary choice of the knot intervals and the topology is possible. Special features like sharp edges and corners are consistently supported by setting selected knot intervals to zero or by applying special rules. Compared to the prior nonuniform rational subdivision surfaces (NURSS), the ESubs offer limit-point rules which are indispensable in many applications, for example, for computer-aided design or in adaptive visualization. The refinement and limit-point rules for our nonuniform, nonstationary scheme are obtained via a new method using local Bezier control points. With our new surface, it is possible to start with existing Catmull Clark as well as NURBS models and to continue the modeling process using the extended subdivision options.

Extended subdivision surfaces: Building a bridge between NURBS and Catmull-Clark surfaces

Several simulations for parallel collision detection have been suggested during the last years. The algorithms usually greatly depend on the parallel infrastructure and this dependency causes in many times non-scalability performance. The dependency also harms the portability of the simulation. This paper suggests a scalable and portable parallel algorithm for collision detection simulation that fits both clusters and MPI machines.

/pdf/scalable-parallel-collision-detection-simulation-1bimvr2uw1.pdf

Scalable parallel collision detection simulation

The Double Insertion, Nonuniform, Stationary subdivision surface (DINUS) generalizes both the nonuniform, bicubic spline surface and the Catmull-Clark subdivision surface. DINUS allows arbitrary knot intervals on the edges, allows incorporation of special features, and provides limit point as well as limit normal rules. It is the first subdivision scheme that gives the user all this flexibility and at the same time all essential limit information, which is important for applications in modeling and adaptive rendering. DINUS is also amenable to analysis techniques for stationary schemes. We implemented DINUS as an Autodesk Maya plugin to show several modeling and rendering examples.

Dinus: Double insertion, nonuniform, stationary subdivision surfaces

Adaptive Tesselation of Subdivision Surfaces

The problem of collision detection between objects is fundamental in many different communities including CAD, robotics, computer graphics, and computational geometry. This article presents a fast collision detection technique for all types of rigid bodies, demonstrated using polygon soups. We present two algorithms for computing a discrete spherical distance field of models. For compactly storing the distance field, we use a subsampling filter bank.

Hierarchical spherical distance fields for collision detection

In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is equally efficient for rigid motions as for arbitrary point motions (deformations). We propose a new efficient realignment algorithm, which produces tighter results compared to all known algorithms. It can be implemented easily in software and in hardware. Using this approach we try to show, that k-DOP bounding volumes can keep up with the theoretically more efficient oriented bounding boxes (OBBs) in parallel-close-proximity situations.

Easy realignment of k-dop bounding volumes

In this article, we present two algorithms for precise collision detection between two potentially colliding objects. The first one uses axis-aligned bounding boxes (AABB) and is a typical representative of a computational geometry algorithm. The second one uses spherical distance fields originating in image processing. Both approaches addresses the following challenges of collision detection algorithms: just in time, little resources, inclusive etc. Thus both approaches are scalable in the information they give in collision determination and the analysis up to a fixed refinement level, the collision time depends on the granularity of the bounding volumes and it is also possible to estimate the time bounds for the collision test tightly

Christoph Fünfzig

Papers

Dinus: Double insertion, nonuniform, stationary subdivision surfaces

Adaptive Tesselation of Subdivision Surfaces

Hierarchical spherical distance fields for collision detection

Easy realignment of k-dop bounding volumes

Two different views on collision detection