Research On Queer Conditions Of 2D Boolean Operations

Two dimensional Boolean operation is the most basic operations in graphics system. It is universally used in CAD system and geometric modeling system. Nowadays'algorithms can give results rapidly enough in general cases. But when it comes to queer conditions, there will be errors. These algorithms have little to do about queer conditions. So this thesis endeavors to come up with an algorithm that can handle queer conditions.Firstly, we expound the main content of 2D Boolean operation, and its importance, summarize some relevant technology and explained intersection-traversal algorithm. Secondly, we do some research on queer conditions, and propose a method to analyze queer conditions using concept of collapse and intersect. We enhance the original intersection-traversal algorithm and give new algorithms on intersection calculation and intersection traversal. We call this algorithm framework global queer handling algorithm, and it can handle queer conditions correctly. In this part, we also discuss curve edges and non-intersect loops. We continue to propose a localized algorithm which can also handle queer condition, but using concept of multi-intersection point instead. We hold a discussion about initialization of the Boolean operation regarding queer conditions, and also hold a comparison of the two new algorithms.Finally, we conclude this dissertation and discus some directions for future work.