On the public citation graph

An all-round sweep algorithm for 2-dimensional nearest-neighbor problems

0 signed · 18 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-50728-0_62openalex-snapshot

A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited

inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot

A sweepline algorithm for Voronoi diagrams

inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot

AnO(n logn) algorithm for the all-nearest-neighbors Problem

inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot

Closest-point problems

inferredcites →https://doi.org/10.1109/sfcs.1989.63525openalex-snapshot

Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic

inferredcites →https://doi.org/10.3929/ethz-a-000604568openalex-snapshot

Robust algorithms in a program library for geometric computation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-54891-2_13openalex-snapshot

XYZ: A project in experimental geometric computation

inferred← citeshttps://doi.org/10.1007/3-540-54891-2_3openalex-snapshot

An on-line algorithm for constructing sweep planes in regular position

inferred← citeshttps://doi.org/10.1007/3-540-57155-8_261openalex-snapshot

A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects

inferred← citeshttps://doi.org/10.1007/3-540-63818-0_1openalex-snapshot

Introduction to geometric computing: From algorithms to software

inferred← citeshttps://doi.org/10.1007/3-540-63818-0_9openalex-snapshot

Precision and robustness in geometric computations

inferred← citeshttps://doi.org/10.1007/3-540-68530-8_15openalex-snapshot

A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)

inferred← citeshttps://doi.org/10.1007/s10707-026-00591-1openalex-snapshot

K Nearest neighbor join algorithms for spatial data using compact and plain data structures in main memory

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50015-2openalex-snapshot

Robustness and Precision Issues in Geometric Computation**Work on this survey was partially supported by the ESPRIT IV Long Term Research Project No. 21957 (CGAL).

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot

Closest-Point Problems in Computational Geometry

inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.002openalex-snapshot

Expected time analysis for Delaunay point location

inferred← citeshttps://doi.org/10.1142/s021819591850005xopenalex-snapshot

A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs

inferred← citeshttps://doi.org/10.1145/997817.997854openalex-snapshot

Towards in-place geometric algorithms and data structures

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.