A Seeking Intersection Algorithms For Curves Surfaces Based On Envelopment Of Encoding For Bounding Boxes

Geometry modeling is one of the kernels of a lot of software systems on Computer-Aided Design, Computer-Aided Manufacturing and Computer Graphics. In geometry modeling, the curve and surface intersection algorithms are the fundamental operation for Boolean operations and to produce necessary elements of B-Rep solid bodies. There are 6 types of SSI algorithms available, they are: geometric division, algebraic, iteration, trace, lattice, analytics and trigonometry methods. But none of them has completely reached a good balance between efficiency and precision, because the research was done either from one side of versatility or merely the other side of precision.The performance of the intersection algorithms mainly determines the efficiency and the stability of the geometry modeling software. The main works of this thesis are as follows. Used the technique of encoding for bounding boxes, constructed the oriented bounding box for small surface which was divided.Turn the oriented bounding box to an axis-aligned bounding box. Used the center of the bounding boxes as the center of the system of coordinates, the roomage are carved up and encoding. Then divided the other surfaces and get the corners and acme from the small surface. Used the boolean calculation between the encoding of corners and acme to judge the connection between surfaces and boxes. These algorithms raise the efficiency for surface intersection.