Fast and accurate collision detection based on enclosed ellipsoid
Ming-Yi Ju, Ming-Yi Ju, Jing‐Sin Liu, Shen-Po Shiang, Yuh-Ren Chien, Kao‐Shing Hwang, Wan‐Chi Lee
Abstract
Ming-Yi Ju, Ming-Yi Ju, Jing‐Sin Liu, Shen-Po Shiang, Yuh-Ren Chien, Kao‐Shing Hwang, Wan‐Chi Lee
Abstract
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 simultaneous use of the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding volume for object representation, and more efficient than the polyhedral methods. An approach for computing the enclosed ellipsoid of a convex polyhedron by compressing, stretching and scaling operations on its best-fit enclosing ellipsoid is introduced. Graphical simulations of two case studies (moving polyhedral objects in three-dimensional space and multiple robot arms undergoing straight line motions) are conducted to demonstrate the accuracy of the proposed algorithm for collision detection.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 simultaneous use of the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding volume for object representation, and more efficient than the polyhedral methods. An approach for computing the enclosed ellipsoid of a convex polyhedron by compressing, stretching and scaling operations on its best-fit enclosing ellipsoid is introduced. Graphical simulations of two case studies (moving polyhedral objects in three-dimensional space and multiple robot arms undergoing straight line motions) are conducted to demonstrate the accuracy of the proposed algorithm for collision detection.
Key concepts: Ellipsoid, Polyhedron, Collision detection, Regular polygon, Bounding overwatch, Bounding volume, Representation (politics), Minimum bounding box