Efficient Computation of the Directional Extremal Boundary of a Union of Equal-Radius Circles
Not on the map. Why?
Abstract (arXiv)
This paper focuses on computing the directional extremal boundary of a union of equal-radius circles. We introduce an efficient algorithm that accurately determines this boundary by analyzing the intersections and dominant relationships among the circles. The algorithm has time complexity of O(n log n).
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 27 Mar 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.