摘要
Hausdorffdistancebetweentwocompactsets,definedasthemaximumdistancefromapointofonesettoanotherset,hasmanyapplicationincomputerscience.Itisagoodmeasureforthesimilarityoftwosets.ThispaperprovesthattheshapedistancebetweentwocompactsetsinR~ndefinedbyminimumHausdorffdistanceunderrigidmotionsisadistance.Theauthorsintroducesimilaritycomparisonproblemsinproteinscience,andproposethatthismeasuremayhavegoodapplicationtocomparisonofproteinstructureaswell.Forcalculationofthisdistance,theauthorsgiveonedimensionalformulasforproblems(2,n),(3,3),and(3,4).Theseformulascanreducetimeneededforsolvingtheseproblems.Theauthorsdidsomenumericalexperimentsfor(2,n).Onthesesetsofdata,thisformulacanreducetimeneededtoonefifteenthofthebestalgorithmsknownonaverage.Asnincreases,itwouldsavemoretime.
出版日期
2009年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）
