OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherIEEE
Pages465-467
Number of pages3
ISBN (Print)0818605456
StatePublished - Dec 1 1984

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Toussaint, G. (1984). OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS. In Proceedings - International Conference on Pattern Recognition (pp. 465-467). IEEE.

OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS. / Toussaint, Godfried.

Proceedings - International Conference on Pattern Recognition. IEEE, 1984. p. 465-467.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Toussaint, G 1984, OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS. in Proceedings - International Conference on Pattern Recognition. IEEE, pp. 465-467.
Toussaint G. OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS. In Proceedings - International Conference on Pattern Recognition. IEEE. 1984. p. 465-467
Toussaint, Godfried. / OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS. Proceedings - International Conference on Pattern Recognition. IEEE, 1984. pp. 465-467
@inproceedings{dc40b438cbc84d3eb7553e46de7cc391,
title = "OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS.",
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.",
author = "Godfried Toussaint",
year = "1984",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818605456",
pages = "465--467",
booktitle = "Proceedings - International Conference on Pattern Recognition",
publisher = "IEEE",

}

TY - GEN

T1 - 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 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:0021627238

SN - 0818605456

SP - 465

EP - 467

BT - Proceedings - International Conference on Pattern Recognition

PB - IEEE

ER -