Abstract
An object is caged by a formation of fingers when it is blocked by the fingers from moving arbitrarily far away. Although some objects such as those with opposing concave sections can be caged by only two fingers, many other objects require at least three. Rectangles and 3-D convex objects without a supporting plane, for example, require at least four. This paper focuses on multifinger squeezing caging in which the positions of fingers obey dispersion constraints. In particular, we present an algorithm for computing all initial finger placements at which the object can be caged in an aforementioned manner. An implementation of the proposed algorithm is described along with implementation results both in 2-D and 3-D.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
