• DocumentCode
    330057
  • Title

    A fast procedure for computing incremental growth distances

  • Author

    Hong, Sun-Mog

  • Author_Institution
    Sch. of Electron. & Electr. Eng., Kyungpook Nat. Univ., Taegu, South Korea
  • Volume
    2
  • fYear
    1998
  • fDate
    13-17 Oct 1998
  • Firstpage
    1170
  • Abstract
    A fast numerical procedure is presented for computing growth distances between a pair of polytopes in R3 that move incrementally along specified smooth paths. The procedure carries out the growth distance evaluations efficiently by predicting and verifying contact configurations between a pair of grown polytopes. The computation time, in average, is very small and does not depend significantly on the geometric complexity of two polytopes
  • Keywords
    computational complexity; computational geometry; set theory; computation time; contact configurations; fast numerical procedure; incremental growth distances; polytopes; smooth paths; Application software; Computer graphics; Contacts; Design automation; Grid computing; Interference; Particle measurements; Robots; Time measurement; Velocity measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Robots and Systems, 1998. Proceedings., 1998 IEEE/RSJ International Conference on
  • Conference_Location
    Victoria, BC
  • Print_ISBN
    0-7803-4465-0
  • Type

    conf

  • DOI
    10.1109/IROS.1998.727457
  • Filename
    727457
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=330057