A Simple Algorithm for Computing BOCP (An Efficient Algorithm for Boolean Operation on Circular-arc Polygons)

In this paper, we investigate the problem of Boolean operation on circular-arc polygons. We present a concise and efficient method, in which the concept of related edges is introduced. Given two circular-arc polygons with M and N edges, respectively, the proposed method only takes O((l+k)∗ log l+M +N) time, where k is the number of intersection points, l is the number of related edges. The proposed method can be easily extended to deal with Boolean operation on traditional polygons.

[1]  John E. Hopcroft,et al.  Robust set operations on polyhedral solids , 1987, IEEE Computer Graphics and Applications.

[2]  Ari Rappoport,et al.  An efficient algorithm for line and polygon clipping , 1991, The Visual Computer.

[3]  Joseph ORourke,et al.  Computational Geometry in C Second Edition , 1998 .

[4]  R. D. Andreev.  Algorithm for Clpping Arbitrary Polygons , 1989, Comput. Graph. Forum.

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

[6]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[8]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[9]  Avraham Margalit,et al.  An algorithm for computing the union, intersection or difference of two polygons , 1989, Comput. Graph..

[10]  Christoph M. Hoffmann,et al.  The problems of accuracy and robustness in geometric computation , 1989, Computer.

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

[12]  Lalit M. Patnaik,et al.  Systolic Architecture for Boolean Operations on Polygons and Polyhedra , 1987, Comput. Graph. Forum.

[13]  Francisco R. Feito-Higueruela,et al.  A new algorithm for computing Boolean operations on polygons , 2009, Comput. Geosci..

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

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

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

[17]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[18]  Yu Liu,et al.  Boolean Operations on Conic Polygons , 2009, Journal of Computer Science and Technology.

[19]  James C. Miller,et al.  Computer graphics principles and practice, second edition , 1992, Comput. Graph..

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

[21]  W. Wang,et al.  A Survey of 3D Solid Reconstruction from 2D Projection Line Drawings , 1993, Comput. Graph. Forum.

[22]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

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

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

[26]  Estelle Perrin,et al.  An algorithm reducing 3D Boolean operations to a 2D problem: concepts and results , 1996, Comput. Aided Des..