Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 2 (1987), S. 541-558 
    ISSN: 1432-0541
    Keywords: Positive grip ; Grip selection ; Force/torque
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study the criteria under which an object can be gripped by a multifingered dexterous hand, assuming no static friction between the object and the fingers; such grips are calledpositive grips. We study three cases in detail: (i) the body is at equilibrium, (ii) the body is under some constant external force/torque, and (iii) the body is under a varying external force/torque. In each case we obtain tight bounds on the number of fingers needed to obtain grip. We also present efficient algorithms to synthesize such positive grips for bounded polyhedral/polygonal objects; the number of fingers employed in the grips synthesized by our algorithms match the above bounds. The algorithms run in time linear in the number of faces/sides. The paper may be of independent interest for its presentation of algorithms arising in the study of positive linear spaces.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 11 (1994), S. 469-484 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Hidden surface removal ; Ray shooting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We derive a new output-sensitive algorithm for hidden surface removal in a collection ofn triangles, viewed from a pointz such that they can be ordered in an acyclic fashion according to their nearness toz. Ifk is the combinatorial complexity of the outputvisibility map, then we obtain a sophisticated randomized algorithm that runs in (randomized) timeO(n4/3 log2.89 n +k 3/5 n 4/5 + δ for anyδ 〉 0. The method is based on a new technique for tracing the visible contours using ray shooting.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...