Efficient Image-Based Proximity Queries with Object-Space Precision

  • Authors:
  • T. Morvan;M. Reimers;E. Samset

  • Affiliations:
  • Interventional Centre, Faculty of Medicine, University of Oslo, Norwaytangui.morvan@medisin.uio.no;Centre of Mathematics for Applications, University of Oslo, Norway, martinre@ifi.uio.no;Centre of Mathematics for Applications, University of Oslo, Norway and Kongsberg SIM, Norway, eigilsa@ifi.uio.no

  • Venue:
  • Computer Graphics Forum
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an efficient algorithm for object-space proximity queries between multiple deformable triangular meshes. Our approach uses the rasterization capabilities of the GPU to produce an image-space representation of the vertices. Using this image-space representation, inter-object vertex-triangle distances and closest points lying under a user-defined threshold are computed in parallel by conservative rasterization of bounding primitives and sorted using atomic operations. We additionally introduce a similar technique to detect penetrating vertices. We show how mechanisms of modern GPUs such as mipmapping, Early-Z and Early-Stencil culling can optimize the performance of our method. Our algorithm is able to compute dense proximity information for complex scenes made of more than a hundred thousand triangles in real time, outperforming a CPU implementation based on bounding volume hierarchies by more than an order of magnitude. © 2012 Wiley Periodicals, Inc.