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

Research output: Contribution to journalConference articlepeer-review

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this