Re2l: An efficient output-sensitive algorithm for computing Boolean operations on circular-arc polygons and its applications

The boundaries of conic polygons consist of conic segments or second degree curves. The conic polygon has two degenerate or special cases: the linear polygon and the circular-arc polygon. The natural problem–Boolean operations on linear polygons–has been extensively studied. Surprisingly, (almost) n...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer aided design Ročník 83; s. 1 - 14
Hlavní autoři: Wang, Zhi-Jie, Lin, Xiao, Fang, Mei-E, Yao, Bin, Peng, Yong, Guan, Haibing, Guo, Minyi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier Ltd 01.02.2017
Elsevier BV
Témata:
Algorithms
Appendix points
Boolean algebra
Boolean operations
Circular-arc polygons
Circularity
Complexity
Intersections
Polygons
Related edges
Segments
Sequence lists
Software reviews
Boolean operations
Circular-arc polygons
Appendix points
Sequence lists
Related edges
ISSN:0010-4485, 1879-2685
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The boundaries of conic polygons consist of conic segments or second degree curves. The conic polygon has two degenerate or special cases: the linear polygon and the circular-arc polygon. The natural problem–Boolean operations on linear polygons–has been extensively studied. Surprisingly, (almost) no article focuses on the problem of Boolean operations on circular-arc polygons, yet this potentially has many applications. This implies that if there is a targeted solution for Boolean operations on circular-arc polygons, it should be favourable for potential users. In this article, we close the gap by devising a concise data structure and then developing a targeted algorithm called Re2l. 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)logl) time, using O(m+n+k) space, where k is the number of intersections, and l is the number of related edges (defined in Section  5). Our algorithm has the power to approximate to linear complexity when k and l are small. The superiority of the proposed algorithm is also validated through empirical study. In particular, our method is of independent interest and we show that it can be easily extended to compute Boolean operations of other types of polygons. •We highlight the circular-arc polygon is one of special cases of the conic polygon, and Boolean operation on circular-arc polygons also has many applications.•We devise a concise and easy-to-operate data structure, and develop a targeted algorithm for Boolean operations on circular-arc polygons.•While this paper focuses on Boolean operations of circular-arc polygons, we show our techniques can be easily extended to compute Boolean operations of other types of polygons.•We provide the rigorous and detailed theoretical analysis for our algorithm.•We conduct extensive experiments to demonstrate the efficiency and effectiveness of our solution.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0010-4485
1879-2685
DOI:10.1016/j.cad.2016.07.004