2015•Unpublished venueRequires access

Bounding sphere CAD model simplification for efficient collision detection in offline programming

Alex Visser, Zengxi Stephen Pan, Stephen van Duin

Open publisher page 8 citations

Abstract

Collision detection performance is one of the major bottlenecks of Automated Offline Programming (AOLP). Simplifying CAD models allows collision detection algorithms to run more quickly, as a result more complex procedures are able to be calculated in a reasonable amount of time using AOLP. This paper presents a randomised bounding volume method for calculating a sphere based representation of a CAD model while conservatively removing small features. The output has fewer spheres when compared with other sphere packing techniques due to the first stage of the algorithm which removes small features from the model. Using the representation generated by the bounding sphere simplification algorithm for collision detection can dramatically improve performance in simulations and motion planning processes commonly used in AOLP.

About this research paper

What this paper is about

Collision detection performance is one of the major bottlenecks of Automated Offline Programming (AOLP). Simplifying CAD models allows collision detection algorithms to run more quickly, as a result more complex procedures are able to be calculated in a reasonable amount of time using AOLP. This paper presents a randomised bounding volume method for calculating a sphere based representation of a CAD model while conservatively removing small features. The output has fewer spheres when compared with other sphere packing techniques due to the first stage of the algorithm which removes small features from the model. Using the representation generated by the bounding sphere simplification algorithm for collision detection can dramatically improve performance in simulations and motion planning processes commonly used in AOLP.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Collision detection performance is one of the major bottlenecks of Automated Offline Programming (AOLP). Simplifying CAD models allows collision detection algorithms to run more quickly, as a result more complex procedures are able to be calculated in a reasonable amount of time using AOLP. This paper presents a randomised bounding volume method for calculating a sphere based representation of a CAD model while conservatively removing small features. The output has fewer spheres when compared with other sphere packing techniques due to the first stage of the algorithm which removes small features from the model. Using the representation generated by the bounding sphere simplification algorithm for collision detection can dramatically improve performance in simulations and motion planning processes commonly used in AOLP.

Key concepts: Collision detection, Bounding volume, Bounding overwatch, CAD, Representation (politics), Computer science, Collision, Minimum bounding box

Related papers

Back to paper searchBrowse research topicsOriginal source
Bounding sphere CAD model simplification for efficient collision detection in offline programming — Research Paper | ScholarLens