Return to search

Finding the minimum vertex distance between two disjoint convex polygons in linear time

No description available.
Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.64748
Date January 1983
CreatorsMcKenna, Michael, 1959-
PublisherMcGill University
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Formatapplication/pdf
CoverageMaster of Science (School of Computer Science.)
RightsAll items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.
Relationalephsysno: 000186602, proquestno: AAIML27393, Theses scanned by UMI/ProQuest.

Page generated in 0.0197 seconds