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.

[1]  Adelaide Denis.  A Discussion of the Cases when Two Quadratic Equations Involving Two Variables can be Solved by the Method of Quadratics , 1903 .

[2]  Ivan E. Sutherland,et al.  Reentrant polygon clipping , 1974, Commun. ACM.

[3]  WeilerKevin,et al.  Hidden surface removal using polygon area sorting , 1977 .

[4]  Peter R. Atherton,et al.  Hidden surface removal using polygon area sorting , 1977, SIGGRAPH.

[5]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[6]  Brian A. Barsky,et al.  An analysis and algorithm for polygon clipping , 1983, CACM.

[7]  蔡士杰,et al.  A Fast Algorithm for Polygon Operations , 1991 .

[8]  Patrick-Gilles Maillot,et al.  A new, fast method for 2D polygon clipping: analysis and software implementation , 1992, TOGS.

[9]  Bala R. Vatti.  A generic solution to polygon clipping , 1992, CACM.

[10]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[11]  A. Edelman,et al.  Polynomial roots from companion matrix eigenvalues , 1995 .

[12]  Günther Greiner,et al.  Efficient clipping of arbitrary polygons , 1998, TOGS.

[13]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[14]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

[15]  Francisco R. Feito-Higueruela,et al.  Boolean operations on general planar polygons , 2000, Comput. Graph..

[16]  Kurt Mehlhorn,et al.  A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons , 2002, ESA.

[17]  Ron Wein,et al.  High-Level Filtering for Arrangements of Conic Arcs , 2002, ESA.

[18]  Sylvain Pion,et al.  Towards and open curved kernel , 2004, SCG '04.

[19]  Jun-Hai Yong,et al.  A new algorithm for Boolean operations on general polygons , 2005, Comput. Graph..

[20]  Borut Zalik,et al.  An algorithm for polygon clipping, and for determining polygon intersections and unions , 2007, Comput. Geosci..

[21]  Shijie Cai,et al.  A fast algorithm for polygon operations , 2008, Journal of Computer Science and Technology.

[22]  Falai Chen,et al.  Algebraic conditions for classifying the positional relationships between two conics and their applications , 2008, Journal of Computer Science and Technology.