Finding the minimum vertex distance between two disjoint convex polygons in linear time

Michael McKenna, Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    Let V = v1, v2, ..., vm and W = w1, w2, ..., wn be two linearly separable convex polygons whose vertices are specified by their cartesian coordinates in order. An algorithm with O(m + n) worst-case time complexity is described for finding the minimum euclidean distance between a vertex v1 in V and a vertex wj in W. It is also shown that the algorithm is optimal.

    Original languageEnglish (US)
    Pages (from-to)1227-1242
    Number of pages16
    JournalComputers and Mathematics with Applications
    Volume11
    Issue number12
    DOIs
    StatePublished - Jan 1 1985

    Fingerprint

    Convex polygon
    Linear Time
    Disjoint
    Minimum Distance
    Vertex of a graph
    Euclidean Distance
    Cartesian
    Time Complexity
    Linearly

    ASJC Scopus subject areas

    • Modeling and Simulation
    • Computational Theory and Mathematics
    • Computational Mathematics

    Cite this

    Finding the minimum vertex distance between two disjoint convex polygons in linear time. / McKenna, Michael; Toussaint, Godfried.

    In: Computers and Mathematics with Applications, Vol. 11, No. 12, 01.01.1985, p. 1227-1242.

    Research output: Contribution to journalArticle

    McKenna, Michael ; Toussaint, Godfried. / Finding the minimum vertex distance between two disjoint convex polygons in linear time. In: Computers and Mathematics with Applications. 1985 ; Vol. 11, No. 12. pp. 1227-1242.
    @article{cbef34598b46487bb6cb2266da8f96ae,
    title = "Finding the minimum vertex distance between two disjoint convex polygons in linear time",
    abstract = "Let V = v1, v2, ..., vm and W = w1, w2, ..., wn be two linearly separable convex polygons whose vertices are specified by their cartesian coordinates in order. An algorithm with O(m + n) worst-case time complexity is described for finding the minimum euclidean distance between a vertex v1 in V and a vertex wj in W. It is also shown that the algorithm is optimal.",
    author = "Michael McKenna and Godfried Toussaint",
    year = "1985",
    month = "1",
    day = "1",
    doi = "10.1016/0898-1221(85)90109-9",
    language = "English (US)",
    volume = "11",
    pages = "1227--1242",
    journal = "Computers and Mathematics with Applications",
    issn = "0898-1221",
    publisher = "Elsevier Limited",
    number = "12",

    }

    TY - JOUR

    T1 - Finding the minimum vertex distance between two disjoint convex polygons in linear time

    AU - McKenna, Michael

    AU - Toussaint, Godfried

    PY - 1985/1/1

    Y1 - 1985/1/1

    N2 - Let V = v1, v2, ..., vm and W = w1, w2, ..., wn be two linearly separable convex polygons whose vertices are specified by their cartesian coordinates in order. An algorithm with O(m + n) worst-case time complexity is described for finding the minimum euclidean distance between a vertex v1 in V and a vertex wj in W. It is also shown that the algorithm is optimal.

    AB - Let V = v1, v2, ..., vm and W = w1, w2, ..., wn be two linearly separable convex polygons whose vertices are specified by their cartesian coordinates in order. An algorithm with O(m + n) worst-case time complexity is described for finding the minimum euclidean distance between a vertex v1 in V and a vertex wj in W. It is also shown that the algorithm is optimal.

    UR - http://www.scopus.com/inward/record.url?scp=0022188797&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0022188797&partnerID=8YFLogxK

    U2 - 10.1016/0898-1221(85)90109-9

    DO - 10.1016/0898-1221(85)90109-9

    M3 - Article

    VL - 11

    SP - 1227

    EP - 1242

    JO - Computers and Mathematics with Applications

    JF - Computers and Mathematics with Applications

    SN - 0898-1221

    IS - 12

    ER -