On the public citation graph

Shallow interdistance selection and interdistance enumeration

https://doi.org/10.1007/bfb0028255
0 signed · 24 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/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00263295openalex-snapshot
Some techniques for geometric searching with implicit set representations
inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferredcites →https://doi.org/10.1016/0020-0190(77)90070-9openalex-snapshot
The complexity of finding fixed-radius near neighbors
inferredcites →https://doi.org/10.1016/0020-0190(89)90166-xopenalex-snapshot
L-infinity interdistance selection by parametric search
inferredcites →https://doi.org/10.1016/0020-0190(90)90056-4openalex-snapshot
Fixed-radius near neighbors search algorithms for points and segments
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1145/109648.109674openalex-snapshot
Enumerating k distances for n points in the plane
inferredcites →https://doi.org/10.1145/98524.98597openalex-snapshot
Selecting distances in the plane
inferredcites →https://doi.org/10.22028/d291-26452openalex-snapshot
Maintaining the minimal distance of a point set in less than linear time

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-54945-5_80openalex-snapshot
Rectangular point location and the dynamic closest pair problem
inferred← citeshttps://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.1007/pl00009340openalex-snapshot
An Optimal Algorithm for Closest-Pair Maintenance
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90215-uopenalex-snapshot
A simple algorithm for enumerating longest distances in the plane
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267752openalex-snapshot
Enumerating the k closest pairs optimally
inferred← citeshttps://doi.org/10.1145/142675.142740openalex-snapshot
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
inferred← citeshttps://doi.org/10.1145/142675.142742openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
inferred← citeshttps://doi.org/10.1145/177424.177621openalex-snapshot
New techniques for exact and approximate dynamic closest-point problems
inferred← citeshttps://doi.org/10.1145/220279.220296openalex-snapshot
An optimal algorithm for closest pair maintenance (extended abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3968openalex-snapshot
Practical Range Aggregation, Selection and Set Maintenance Techniques
inferred← citeshttps://doi.org/10.5555/127787.127796openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.5555/313559.313784openalex-snapshot
Randomized data structures for the dynamic closest-pair problem
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.