In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency.  ...  Given two circular-arc polygons with m and n edges respectively, our method runs in O(m+n+(l+k) l) time, using O(m+n+k) space, where k is the number of intersections, and l is the number of edges.  ...  applications. 2) We devise a concise and easy-to-operate data structure, and develop a targeted algorithm for boolean operations on circular-arc polygons. 3) While this paper focuses on boolean operations  ...