Efficient maintenance and self-collision testing for kinematic chains

DOI10.1145/513400.513406zbMATH Open1414.68132OpenAlexW2149356121MaRDI QIDQ4557536FDOQ4557536

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

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

zbMATH Keywords

molecular modellingcollision detectionself-collisionsbounding-volume hierarchymodelling kinematic chains

Mathematics Subject Classification ID

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

Cited In (5)

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

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)