### Abstract

Let V = v_{1}, v_{2}, ..., v_{m} and W = w_{1}, w_{2}, ..., w_{n} 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 v_{1} in V and a vertex w_{j} in W. It is also shown that the algorithm is optimal.

Original language | English (US) |
---|---|

Pages (from-to) | 1227-1242 |

Number of pages | 16 |

Journal | Computers and Mathematics with Applications |

Volume | 11 |

Issue number | 12 |

DOIs | |

State | Published - Jan 1 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Modeling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics

### Cite this

*Computers and Mathematics with Applications*,

*11*(12), 1227-1242. https://doi.org/10.1016/0898-1221(85)90109-9

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

Research output: Contribution to journal › Article

*Computers and Mathematics with Applications*, vol. 11, no. 12, pp. 1227-1242. https://doi.org/10.1016/0898-1221(85)90109-9

}

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 -