Skip to search formSkip to main contentSkip to account menu

Sweep and prune

Known as: Sort and sweep 
In physical simulations, sweep and prune is a broad phase algorithm used during collision detection to limit the number of pairs of solids that need… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Bounding sphereBounding volumeBounding volume hierarchyCollision detection

Broader (1)

Computational physics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A collision framework for rigid and deformable body simulation
This thesis describes methods for collision detection and collision response, implemented in a complete collision framework for… 
2015
2015
An Incremental Learning System for Interactive Gestural Control of Sound Synthesis
2014
2014
1D sweep-and-prune self-collision detection for deforming cables
Detecting self-collision for cables and similar objects is an important part of numerous models in computational biology (protein… 
2013
2013
1D sweep-and-prune self-collision detection for deforming cables
Detecting self-collision for cables and similar objects is an important part of numerous models in computational biology (protein… 
2013
2013
Parallelizing Broad Phase Collision Detection Algorithms for Sampling Based Path Planners
Collision checking takes most of the time in sampling based path planning algorithms. When the scene gets crowded, more samples… 
2009
2009
A collision detection algorithm using adaptive particle sensor
We present an adaptive algorithm for collision detection between rigid and non-rigid polygonal objects by improving particle… 
2008
2008
An evaluation of a collision handling system using sphere-trees for plausible rigid body animation
Collision handling plays a fundamental role for achieving realism and interactivity in 3D graphical systems. Nevertheless, it is… 
2006
2006
Performance Evaluation of a Hybrid Algorithm for Collision Detection in Crowded Interactive Environments
Crowded interactive environments composed of a large number of objects need a fast, accurate and scalable mechanism for collision… 
1995
1995
Fast algorithms for penetration and contact determination between non-convex polyhedral models
We present fast algorithms for penetration detection and contact determination between polyhedral models in dynamic environments… 
1995
1995
Incremental collision detection for polygonal models
1 Introduction Fast and accurate collision detection between general polygonal models is a fundamental problem for computational… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)