• DocumentCode
    716080
  • Title

    PhongPD: Gradient-continuous penetration metric for polygonal models using Phong projection

  • Author

    Youngeun Lee ; Kim, Young J.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Ewha Womans Univ. in Seoul, South Korea
  • fYear
    2015
  • fDate
    26-30 May 2015
  • Firstpage
    57
  • Lastpage
    62
  • Abstract
    We present a novel algorithm to compute a gradient-continuous penetration depth (PhongPD) between two interpenetrated polygonal models. Our penetration depth (PD) formulation ensures separating the intersected models by translation, and the amount of such translation is close to an optimal motion to resolve interpenetration in most cases. In order to achieve the gradient-continuity in our algorithm, we interpolate tangent planes continuously over the contact space and then perform a projection along a normal direction defined by the interpolated tangent planes; this projection scheme is known as Phong projection. We have implemented our PhongPD algorithm and certifies its continuity using three benchmarks consisting of diverse combinatorial complexities, and show that our algorithm shows smoother PD results than a conventional Euclidean-projection-based PD method.
  • Keywords
    gradient methods; interpolation; robots; Euclidean-projection-based PD method; Phong projection; PhongPD algorithm; combinatorial complexity; gradient-continuous penetration metric; interpenetrated polygonal models; robotics; tangent plane interpolation; Benchmark testing; Complexity theory; Computational modeling; Handheld computers; Interpolation; Measurement; Robots;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Robotics and Automation (ICRA), 2015 IEEE International Conference on
  • Conference_Location
    Seattle, WA
  • Type

    conf

  • DOI
    10.1109/ICRA.2015.7138980
  • Filename
    7138980