### Abstract

Let P={p_{1}, p_{2}, ..., p_{m}} and Q={q_{1}, q_{2}, ..., q_{n}} be two intersecting convex polygons whose vertices are specified by their cartesian coordinates in order. An optimal O(m+n) algorithm is presented for computing the minimum euclidean distance betweena vertex p_{i} in P and a vertex q_{j} in Q.

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

Pages (from-to) | 357-364 |

Number of pages | 8 |

Journal | Computing |

Volume | 32 |

Issue number | 4 |

DOIs | |

State | Published - Dec 1 1984 |

### Fingerprint

### Keywords

- Algorithms
- complexity
- computational geometry
- convex polygons
- minimum distance
- Voronoi diagrams

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics

### Cite this

**An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.** / Toussaint, Godfried.

Research output: Contribution to journal › Article

*Computing*, vol. 32, no. 4, pp. 357-364. https://doi.org/10.1007/BF02243778

}

TY - JOUR

T1 - An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

AU - Toussaint, Godfried

PY - 1984/12/1

Y1 - 1984/12/1

N2 - Let P={p1, p2, ..., pm} and Q={q1, q2, ..., qn} be two intersecting convex polygons whose vertices are specified by their cartesian coordinates in order. An optimal O(m+n) algorithm is presented for computing the minimum euclidean distance betweena vertex pi in P and a vertex qj in Q.

AB - Let P={p1, p2, ..., pm} and Q={q1, q2, ..., qn} be two intersecting convex polygons whose vertices are specified by their cartesian coordinates in order. An optimal O(m+n) algorithm is presented for computing the minimum euclidean distance betweena vertex pi in P and a vertex qj in Q.

KW - Algorithms

KW - complexity

KW - computational geometry

KW - convex polygons

KW - minimum distance

KW - Voronoi diagrams

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

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

U2 - 10.1007/BF02243778

DO - 10.1007/BF02243778

M3 - Article

AN - SCOPUS:0021290263

VL - 32

SP - 357

EP - 364

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 4

ER -