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

Research output: Contribution to journalConference article

Original languageEnglish (US)
Pages (from-to)457-458
Number of pages2
JournalProceedings - Annual Allerton Conference on Communication, Control, and Computing
StatePublished - Dec 1 1983

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{1b4e1cbc36ad44beb47fe0c6996fd98b,
title = "OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN TWO CROSSING CONVEX POLYGONS.",
author = "Godfried Toussaint",
year = "1983",
month = "12",
day = "1",
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

PY - 1983/12/1

Y1 - 1983/12/1

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 -