• Login
    View Item 
    •   DSpace Home
    • Researchers
    • Kenneth Sundaraj, Assoc. Prof. Dr.
    • View Item
    •   DSpace Home
    • Researchers
    • Kenneth Sundaraj, Assoc. Prof. Dr.
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A new algorithm for computing minimum distance

    Thumbnail
    View/Open
    A new algorithm for computing minimum distance.pdf (196.9Kb)
    Date
    2000
    Author
    Sundaraj, Kenneth, Prof. Dr.
    d'Aulignac, D
    Mazer, E
    Metadata
    Show full item record
    Abstract
    This paper presents a new algorithm for computing the minimum distance between convex polyhedras. The algorithm of Gilbert-Johnson-Keerthi (GJK) and the algorithm of Lin-Canny (LC) are well-known fast solutions to the problem. We show how a mix between LC's idea and the GJK's algorithm can be used to solve the problem. In our algorithm, we use local methods to calculate the distance between features and new “updating” conditions to add stability. These new conditions enable one to ensure more stability when compared to GJK. We also modify our terminating conditions to add robustness to our approach. Our experiments also show that the expected running time of our approach is constant, independent of the complexity of the polyhedra. We present some comparisons of our method with GJK.
    URI
    http://dspace.unimap.edu.my:80/dspace/handle/123456789/33164
    Collections
    • Kenneth Sundaraj, Assoc. Prof. Dr. [114]

    Atmire NV

    Perpustakaan Tuanku Syed Faizuddin Putra (PTSFP) | Send Feedback
     

     

    Browse

    All of UniMAP Library Digital RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    Atmire NV

    Perpustakaan Tuanku Syed Faizuddin Putra (PTSFP) | Send Feedback