### 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 | |

Publication status | Published - Jan 1 1985 |

### Fingerprint

### ASJC Scopus subject areas

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