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

Alexander Gribov

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.21711 v1 pith:FO7GBFUM submitted 2025-03-27 cs.CG

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

Alexander Gribov This is my paper

classification cs.CG

keywords boundarycirclesalgorithmdirectionalefficientequal-radiusextremalunion

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

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

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Rail Track Extraction from Rasterized Classified Point Clouds Using a Full-Resolution, Fully Convolutional Recurrent Neural Network
cs.CV 2026-07 conditional novelty 6.0

FRPDF, a full-resolution progressive dilated fusion recurrent network trained solely on synthetic rasters, extracts rail-top and track centerlines from classified MLS point clouds.