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

Publication series

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