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

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)357-364
Number of pages8
JournalComputing
Volume32
Issue number4
DOIs
StatePublished - Dec 1 1984

Fingerprint

Convex polygon
Optimal Algorithm
Computing
p.m.
Minimum Distance
Vertex of a graph
Euclidean Distance
Pi
Cartesian

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.

In: Computing, Vol. 32, No. 4, 01.12.1984, p. 357-364.

Research output: Contribution to journalArticle

@article{0d40a742ae064d5dbbd58e2839b54dc5,
title = "An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons",
abstract = "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.",
keywords = "Algorithms, complexity, computational geometry, convex polygons, minimum distance, Voronoi diagrams",
author = "Godfried Toussaint",
year = "1984",
month = "12",
day = "1",
doi = "10.1007/BF02243778",
language = "English (US)",
volume = "32",
pages = "357--364",
journal = "Computing (Vienna/New York)",
issn = "0010-485X",
publisher = "Springer Wien",
number = "4",

}

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 -