An adaptive quadtree algorithm with curvature-guided Monte Carlo sampling for multi-circle polygon intersections achieves O(1/ε^{3/2}) complexity at O(ε) error, outperforming classical methods in experiments.
Hilden, Testing the relative positions of several points on a circle, BIT Numerical Mathematics 12 (1972) 182–187
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation
An adaptive quadtree algorithm with curvature-guided Monte Carlo sampling for multi-circle polygon intersections achieves O(1/ε^{3/2}) complexity at O(ε) error, outperforming classical methods in experiments.