# Efficient Computation of the Directional Extremal Boundary of a Union of Equal-Radius Circles

arXiv: https://arxiv.org/abs/2503.21711 · HTML: https://mlsanity.com/paper/2503.21711/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Mar 2025.

## Built on by (most cited first, 1 of 1)

- [Rail Track Extraction from Rasterized Classified Point Clouds Using a Full-Resolution, Fully Convolutional Recurrent Neural Network](https://mlsanity.com/paper/2607.06829/) (2026)

## 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).