Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2605.15627 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914568838578176 |
|---|---|
| author | Yi, Zeping Wang, Yongjun Wang, Baoshan Li, Lan Liu, Songyi |
| author_facet | Yi, Zeping Wang, Yongjun Wang, Baoshan Li, Lan Liu, Songyi |
| contents | In this paper, we present an improved numerical algorithm for computing the intersection area of multiple circles and a complex polygon efficiently. This geometric problem is fundamental to applications such as wireless sensor networks and base station deployment. The key idea is a curvature-multiplicity-guided adaptive sampling strategy that dynamically concentrates sampling points in geometrically complex boundary regions. The algorithm integrates three components: (i) adaptive quadtree partitioning, (ii) analytical integration via Green's theorem for cells intersecting a single circle, and (iii) curvature-multiplicity-guided Monte Carlo subsampling for cells intersecting multiple circles, where a minimum sample count and a constant factor are introduced into the sampling size. Theoretical analysis shows that the algorithm achieves O(1/ε3/2) computational complexity while maintaining an O(ε) error bound, improving upon the O(1/ε2) complexity of classical Monte Carlo and uniform grid methods for the same error tolerance ε. Numerical experiments on complex polygons, including synthetic data and real-world scenarios, demonstrate that our algorithm outperforms five classical methods in terms of relative error. Furthermore, parameter sensitivity analysis confirms that the algorithm is robust and could make it suited for practical applications such as wireless sensor network coverage estimation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_15627 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation Yi, Zeping Wang, Yongjun Wang, Baoshan Li, Lan Liu, Songyi Computational Geometry In this paper, we present an improved numerical algorithm for computing the intersection area of multiple circles and a complex polygon efficiently. This geometric problem is fundamental to applications such as wireless sensor networks and base station deployment. The key idea is a curvature-multiplicity-guided adaptive sampling strategy that dynamically concentrates sampling points in geometrically complex boundary regions. The algorithm integrates three components: (i) adaptive quadtree partitioning, (ii) analytical integration via Green's theorem for cells intersecting a single circle, and (iii) curvature-multiplicity-guided Monte Carlo subsampling for cells intersecting multiple circles, where a minimum sample count and a constant factor are introduced into the sampling size. Theoretical analysis shows that the algorithm achieves O(1/ε3/2) computational complexity while maintaining an O(ε) error bound, improving upon the O(1/ε2) complexity of classical Monte Carlo and uniform grid methods for the same error tolerance ε. Numerical experiments on complex polygons, including synthetic data and real-world scenarios, demonstrate that our algorithm outperforms five classical methods in terms of relative error. Furthermore, parameter sensitivity analysis confirms that the algorithm is robust and could make it suited for practical applications such as wireless sensor network coverage estimation. |
| title | An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2605.15627 |