ALGORITHM FOR SEEKING INTERSECTION POINTS FOR DIGITAL LINE BASED ON SEGMENT CODES

Searching point of intersection between curves is an important problem in computer graphics.Yet the problem of intersection between straight lines is the basis of this kind of problem. While traditional solving methods are mostly based on Euclidean Geometry Modeling,this paper discusses the inaccuracy of the traditional methods and proposes a new method to solve the intersection problem precisely which is based on segment code in Pan-Euclidean Geometry. Also as the basic principle of dealing with discrete problems,this method can be applied to solving other complex problems.