Boolean Operations on Conic Polygons

An algorithm for Boolean operations on conic polygons is proposed. Conic polygons are polygons consisting of conic segments or bounded conics with directions. Preliminaries of Boolean operations on general polygons are presented. In our algorithm, the intersection points and the topological relationships between two conic polygons are computed. Boundaries are obtained by tracking path and selecting uncrossed boundaries following rule tables to build resulting conic polygons. We define a set of rules for the intersection, union, and subtraction operations on conic polygons. The algorithm considers degeneration cases such as homology, complement, interior, and exterior. The algorithm is also evaluated and implemented. Electronic supplementary material The online version of this article (doi: ) contains supplementary material, which is available to authorized users. Supported by the National High Technology Development and Research 863 Program of China under Grant Nos. 2007AA12Z216 and 2007AA120502 and the National Natural Science Foundation of China under Grant Nos. 40701134, 40771171, and 40629001.