Efficient distance computation between non-convex objects

  title={Efficient distance computation between non-convex objects},
  author={Sean Quinlan},
  journal={Proceedings of the 1994 IEEE International Conference on Robotics and Automation},
  pages={3324-3329 vol.4}
  • Sean Quinlan
  • Published 8 May 1994
  • Computer Science
  • Proceedings of the 1994 IEEE International Conference on Robotics and Automation
This paper describes an efficient algorithm for computing the distance between nonconvex objects. Objects are modeled as the union of a set of convex components. From this model we construct a hierarchical bounding representation based on spheres. The distance between objects is determined by computing the distance between pairs of convex components using preexisting techniques. The key to efficiency is a simple search routine that uses the bounding representation to ignore most of the possible… 

Figures from this paper

An incremental version of growth distance

  • C. OngEugene Huang
  • Computer Science
    Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146)
  • 1998
A fast algorithm is presented for computing the growth distance between a pair of convex objects in three dimensional space using geometrical consideration and shows that the performance is in the same range as the known fastest Euclidean distance code.

Computing distances between surfaces using line geometry

This approach produces an efficient algorithm for computing the distance between two ellipsoids, where the problem is reduced to finding a specific solution in a system of two equations in two variables.

Computing the Distance Between Two Surfaces via Line Geometry

Using line geometry, the distance computation is reformulated as a simple instance of a surface-surface intersection problem, which leads to a low-dimensional root finding in a system of equations.

Fast convex minimization to detect collisions between polyhedra

  • C. MiroloE. Pagello
  • Computer Science
    Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113)
  • 2000
A faster version of the algorithm, particularly suited to plan collision-free paths on the basis of fine-grain descriptions of the objects in the workspace, as it is the case for the systems supported by sophisticated geometric modelers.

A fast growth distance algorithm for incremental motions

A fast algorithm is presented for computing the growth distance between a pair of convex objects in three-dimensional space that is in the same range as the fastest codes for the computation of the Euclidean separation distance.

Adaptive medial-axis approximation for sphere-tree construction

A novel algorithm for the construction of sphere-trees that approximates objects, both convex and non-convex, with a higher degree of fit than existing algorithms is presented.

Fast and accurate collision detection based on enclosed ellipsoid

A fast and accurate method for detecting the collisions of convex polyhedra in a graphical simulation environment based on a newly developed method of distance estimate is presented. By the

Exact distance computation for deformable objects

A novel approach for the computation of the minimum distance between arbitrarily shaped, triangulated objects by employing characteristics of the Gilbert-Johnson-Keerthi algorithm to efficiently compute lower and upper bounds of theminimum distance between non-convex objects.

The nearest point problem in a polyhedral set and its extensions

This approach can be employed to minimize any strictly convex quadratic function over a polyhedral set and is shown to be more effective than other existing methods for solving these problems.

An Accurate Distance-Calculation Algorithm for Convex Polyhedra

An efficient and accurate algorithm to calculate the distance between convex polyhedra, which can be calculated by simple projections and can be followed continuously in time.



A fast algorithm for incremental distance calculation

  • Ming C. LinJ. Canny
  • Computer Science
    Proceedings. 1991 IEEE International Conference on Robotics and Automation
  • 1991
A simple and efficient algorithm for finding the closest points between two convex polynomials is described and can be used for collision detection, computation of the distance between two polyhedra in three-dimensional space, and other robotics problems.

A fast procedure for computing the distance between complex objects in three-dimensional space

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.

Efficient collision detection for animation and robotics

An opportunistic global path planner algorithm which uses the incremental distance computation algorithm to trace out a one-dimensional skeleton for the purpose of robot motion planning and its performance attests their promise for real-time dynamic simulations as well as applications in a computer generated virtual environment.

Determining the Separation of Preprocessed Polyhedra - A Unified Approach

The emphasis is the uniform treatment of polyhedra separation problems, the use of hierarchical representations of primitive objects to provide implicit representations of composite or transformed objects, and applications to natural problems in graphics and robotics.

OBBTree: a hierarchical structure for rapid interference detection

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.

Approximating polyhedra with spheres for time-critical collision detection

A method for approximating polyhedral objects to support a time-critical collision-detectional algorithm that maintains its real-time performance as objects become more complicated, even as they exceed previouslyreported complexity levels by a factor of more than 10.

Hierarchical object models for efficient anti-collision algorithms

  • B. Faverjon
  • Computer Science
    Proceedings, 1989 International Conference on Robotics and Automation
  • 1989
An offline programming system specially designed for complex robotic applications (e.g., intervention of redundant manipulators in a nuclear plant) that uses hierarchical CAD models of solids and manipulators derived from constructive solid geometry trees.

A new representation for collision avoidance and detection

By combining the simplicity of the sphere and the power of the motion of hierarchy of detail, a novel model is proposed with applications to collision avoidance and detection in 3D. The model is

Curved surfaces and coherence for non-penetrating rigid body simulation

Algorithms for performing collision detection during simulation on bodies composed of both polyhedra and strictly convex curved surfaces are presented and exploit the geometric coherence between successive time steps of the simulation to achieve efficient running times.

Computational geometry: an introduction

This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.