### Abstract

Let P equals left brace p//1,p//2,. . . ,p//m right brace and Q equals left brace q//1,q//2,. . . ,q//n right brace be two intersecting convex polygons whose vertices are specified by their cartesian coordinates in order. An optimal 0(m plus n) algorithm is presented for computing the minimum euclidean distance between a vertex p//i in P and a vertex q//j in Q.

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

Title of host publication | Proceedings - International Conference on Pattern Recognition |

Publisher | IEEE |

Pages | 465-467 |

Number of pages | 3 |

ISBN (Print) | 0818605456 |

State | Published - 1984 |

### Publication series

Name | Proceedings - International Conference on Pattern Recognition |
---|

### ASJC Scopus subject areas

- Computer Vision and Pattern Recognition

## Cite this

Toussaint, G. T. (1984). OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS. In

*Proceedings - International Conference on Pattern Recognition*(pp. 465-467). (Proceedings - International Conference on Pattern Recognition). IEEE.