基于段码的离散直线求交

求交是计算机图形学的重要问题，而直线求交又是复杂曲线求交的基础。传统的求交算法多是基于欧氏几何的模型进行的，本文从泛欧几何的模型出发，论述了传统模型的不准确性，提出了基于段码的准确求交方法，该方法也是泛欧几何处理离散问题的基本原则，可以推广到曲线等复杂求交中。

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.