The Reachability Problem in a Concave Region: A New Context

DOI10.1007/3-540-44862-4_93MaRDI QIDQ3527863zbMATH OpenOpenAlexFDO

Authors Ali Mohades, Mohammad Ebrahim Shiri, Mohammadreza Razzazi

Publication date 30 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44862-4_93

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1728323
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• Motions of a short-linked robot arm in a square
• How far can you reach?
• Locked and unlocked polygonal chains in three dimensions

Cited in

(2)

• scientific article; zbMATH DE number 1728323 (Why is no real title available?)
• scientific article; zbMATH DE number 4074328 (Why is no real title available?)

This page was built for publication: The Reachability Problem in a Concave Region: A New Context

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