A framework for benchmarking interactive collision detection
Muiris Woulfe,Michael Manzke +1 more
- 23 Apr 2009
- pp 205-212
TL;DR: A framework for benchmarking interactive collision detection, which consists of a single generic benchmark that can be adapted using a number of parameters to create a large range of practical benchmarks, and which demonstrates that conventional wisdom cannot be relied on for selecting a collision detection algorithm and that the framework fulfils a vital need in the collision detection community.
read more
Abstract: Collision detection is a vital component of applications spanning myriad fields, yet there exists no means for developers to analyse the suitability of their collision detection algorithms across the spectrum of scenarios that could be encountered. To rectify this, we propose a framework for benchmarking interactive collision detection, which consists of a single generic benchmark that can be adapted using a number of parameters to create a large range of practical benchmarks. This framework allows algorithm developers to test the validity of their algorithms across a wide test space and allows developers of interactive applications to recreate their application scenarios and quickly determine the most amenable algorithm. To demonstrate the utility of our framework, we adapted it to work with three collision detection algorithms supplied with the Bullet Physics SDK. Our results demonstrate that those algorithms conventionally believed to offer the best performance are not always the correct choice. This demonstrates that conventional wisdom cannot be relied on for selecting a collision detection algorithm and that our benchmarking framework fulfils a vital need in the collision detection community. The framework has been made open source, so that developers do not have to reprogram the framework to test their own algorithms, allowing for consistent results across different algorithms and reducing development time.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Interactive Simulation of Rigid Body Dynamics in Computer Graphics
TL;DR: In this paper, a self-contained state-of-the-art report on the physics, the models, the numerical methods and the algorithms used in interactive rigid body simulation all of which have evolved and matured over the past 20 years.
232
Dynamics analysis and GNC design of flexible systems for space debris active removal
TL;DR: In this article, the authors show that tethered-net systems are a promising technology to capture and remove space debris and discuss the main difficulties that are likely to take place during capture and disposal phases, particularly from a GNC point of view.
135
Mixed Precision Processing in Reconfigurable Systems
Gary C.T. Chow,Ka-Wai Kwok,Wayne Luk,Philip H. W. Leong +3 more
- 01 May 2011
TL;DR: A novel methodology for mixed- Precision comparison is introduced, which improves comparison performance by using reduced-precision data paths while maintaining accuracy by using high-preision data paths.
17
OpenCollBench - Benchmarking of Collision Detection & Proximity Queries as a Web-Service
Toni Tan,Rene Weller,Gabriel Zachmann +2 more
- 09 Nov 2020
TL;DR: A server-based benchmark that enables a fair analysis of different collision detection & proximity query algorithms and proposes a heatmap visualization directly on the benchmarked objects that allows the identification of critical regions on a sub-object level.
4
A hybrid fixed-function and microprocessor solution for high-throughput broad-phase collision detection
Muiris Woulfe,Michael Manzke +1 more
TL;DR: A hybrid system spanning a fixed-function microarchitecture and a general-purpose microprocessor is presented, designed to amplify the throughput and decrease the power dissipation of collision detection relative to what can be achieved using CPUs or GPUs alone.
References
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
8.2K
An Algorithm for Finding Best Matches in Logarithmic Expected Time
TL;DR: An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
OBBTree: a hierarchical structure for rapid interference detection
Stefan Gottschalk,Ming C. Lin,Dinesh Manocha +2 more
- 01 Aug 1996
TL;DR: A data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion that can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates are presented.
Zippered polygon meshes from range images
Greg Turk,Marc Levoy +1 more
- 24 Jul 1994
TL;DR: A method for combining a collection of range images into a single polygonal mesh that completely describes an object to the extent that it is visible from the outside is presented.
A fast procedure for computing the distance between complex objects in three-dimensional space
Elmer G. Gilbert,D.W. Johnson,S. Keerthi +2 more
- 01 Apr 1988
TL;DR: An algorithm for computing the Euclidean distance between a pair of convex sets in R/sup m/ has special features which makes its application in a variety of robotics problems attractive.