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

Research output: Contribution to journal › Conference article › peer-review

Original language	English (US)
Pages (from-to)	457-458
Number of pages	2
Journal	Proceedings - Annual Allerton Conference on Communication, Control, and Computing
State	Published - 1983

ASJC Scopus subject areas

@article{1b4e1cbc36ad44beb47fe0c6996fd98b,

title = "OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS.",

author = "Toussaint, {Godfried T.}",

year = "1983",

language = "English (US)",

pages = "457--458",

journal = "Proceedings - Annual Allerton Conference on Communication, Control, and Computing",

issn = "0732-6181",

}

TY - JOUR

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

AU - Toussaint, Godfried T.

PY - 1983

Y1 - 1983

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

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

M3 - Conference article

AN - SCOPUS:0021006132

SP - 457

EP - 458

JO - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

JF - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

SN - 0732-6181

ER -