Abstract
Part I described the derivation of a grade rule data file. This paper explains algorithms that use the data file to automatically grade both basic block patterns and adapted patterns. A technique of "nearest point" is proposed whereby a new or displaced point on an adapted pattern derives its grade rules from the point on the basic block pattern closest to it. This technique facilitates, automatically, the grading process of both a basic block pattern and an adapted pattern. Some special treatments are considered to improve grading quality and meet special requirements.
Get full access to this article
View all access options for this article.
