Study Of Dynamic Geometry Matching Degree Algorithm

Traditional based on keyword search, classified search and based on figure search whichis proposed in recent years are the three major search technology in the Internet today. Due tothe particularity of dynamic geometric resources, the three search technology are not suitablefor searching dynamic geometry resources on the Internet. The lack of effective searchalgorithm has become a major bottleneck of restricting dynamic geometry resource sharing,the study of dynamic geometry search algorithm becomes a very important issue to solve theplane geometry resources search.Dynamic geometry mainly has two kinds of formal description language: drawinglanguage and constraint language. Most dynamic geometry software use drawing language todescribe the dynamic geometry. Drawing language describes dynamic geometry as a sequenceof drawing sentences. In this paper, according to people’s intuitive cognition distinguish thedifferent geometries and combining the characteristic of the dynamic geometry, we propose adynamic geometry matching algorithm which is based on identification code. The dynamicgeometry matching algorithm firstly extracts figures identification code from the inputsentences describing the sequence of two dynamic geometries, then according to the figureidentification code to calculate matching degree of the two dynamic geometries. Figureidentification code is a kind of quantity characteristic of dynamic geometry, which is made upof point identification code, line identification code, circle identification code, segmentidentification code and triangle identification code. The identification code of the five basicgeometric objects are the number of points, lines, circles,segments and triangles in thedynamic geometry.With the corresponding these five id code, we respectively define pointmatching degree, line matching degree, circle matching degree, segment matching degree andtriangle matching degree. We also propose dynamic geometry matching degree through theweights of these five kinds of matching degree. Matching degree is a measurement based onpeople’s cognition to distinguish different geometry.In this paper, the dynamic geometry matching algorithm based on identification code hasthe characteristics of simple, efficient and effortless implement. Not only can be used to research geometry problems in dynamic geometry resource databases, but also can be used toresearch on the Internet.