Graph algorithm sutdying is key for CAD system developing.This paper study some problems of specialty graph operation algorithm for mining CAD in detail,and analysis and define mine basic graph geometry characteristic...Graph algorithm sutdying is key for CAD system developing.This paper study some problems of specialty graph operation algorithm for mining CAD in detail,and analysis and define mine basic graph geometry characteristic.The authors provided a calculateing method of vector intersection and vector eigenvalue,and discussed its function in mining graph operation.From the the eigenvalue graph features of vector pointintersection,this paper also discussed the relationship between point and polygon,polygon and polygon for mining graph operation.Finally,an algorithm of polygon or vector intersectionpoint parallel push out or pull in was given,and five examples of polygon graph operation were given.3figs.,7refs.展开更多
文摘Graph algorithm sutdying is key for CAD system developing.This paper study some problems of specialty graph operation algorithm for mining CAD in detail,and analysis and define mine basic graph geometry characteristic.The authors provided a calculateing method of vector intersection and vector eigenvalue,and discussed its function in mining graph operation.From the the eigenvalue graph features of vector pointintersection,this paper also discussed the relationship between point and polygon,polygon and polygon for mining graph operation.Finally,an algorithm of polygon or vector intersectionpoint parallel push out or pull in was given,and five examples of polygon graph operation were given.3figs.,7refs.
