Efficient maintenance and self-collision testing for kinematic chains

DOI10.1145/513400.513406MaRDI QIDQ4557536zbMATH OpenOpenAlexFDO

Authors Itay Lotan, Fabian Schwarzer, Jean-Claude Latombe, Dan Halperin

Publication date 23 November 2018

Published in Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/513400.513406

zbMATH Keywords

bounding-volume hierarchycollision detectionmodelling kinematic chainsmolecular modellingself-collisions

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Kinematics of mechanisms and robots (70B15) Biochemistry, molecular biology (92C40)

Recommendations

• DETERMINATION OF THE OPTIMAL MAXIMUM ISSUE QUANTITY FOR LUMPY DEMAND ITEMS WHEN CONTROLLED BY AN U,S) POLICY
• Real-time self-collision detection algorithms for tensegrity systems
• scientific article; zbMATH DE number 1031293
• Motion planning algorithms for molecular simulations: a survey
• The GJK distance algorithm: an interval version for incremental motions

Cited in

(5)

• Preprocessing chains for fast dihedral rotations is hard or even impossible.
• Local polyhedra and geometric graphs
• Deformable spanners and applications
• Motion planning algorithms for molecular simulations: a survey
• Collision detection for deforming necklaces

This page was built for publication: Efficient maintenance and self-collision testing for kinematic chains

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