Collision detection algorithm of a continuous type using spherical extreme vertex diagrams

DOI10.1016/S0898-1221(04)90129-0zbMATH Open1155.70301MaRDI QIDQ1767855FDOQ1767855

Authors: Hyoung Seok Kim, Hong Oh Kim, Sung Yong Shin 

Publication date: 8 March 2005

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Recommendations

• A vertex algorithm for collision detection
• scientific article; zbMATH DE number 1280933
• An optimal algorithm for solving collision distance between convex polygons in plane
• An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane
• scientific article; zbMATH DE number 1305422

zbMATH Keywords

Convex hullExtreme vertex problemSpherical Voronoi diagram

Mathematics Subject Classification ID

Convex programming (90C25) Kinematics of mechanisms and robots (70B15) Computational methods for problems pertaining to mechanics of particles and systems (70-08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Solving related two- and three-dimensional linear programming problems in logarithmic time
• An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane

Cited In (4)

• SMB: Collision detection based on temporal coherence
• Fast and exact continuous collision detection with Bernstein sign classification
• Computational Science - ICCS 2004
• TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION

This page was built for publication: Collision detection algorithm of a continuous type using spherical extreme vertex diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767855)