On the public citation graph

Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs

https://doi.org/10.1007/bf02187721
0 signed · 27 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-2130-2_6openalex-snapshot
Infinite and Finite Sets
inferredcites →https://doi.org/10.1007/bf02414146openalex-snapshot
On some problems of elementary and combinatorial geometry
inferredcites →https://doi.org/10.1007/bf02579184openalex-snapshot
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1016/0097-3165(84)90047-5openalex-snapshot
Unit distances
inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1080/00029890.1984.11971450openalex-snapshot
The Number of Furthest Neighbour Pairs of a Finite Planar Set
inferredcites →https://doi.org/10.2307/2305092openalex-snapshot
On Sets of Distances of n Points

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_8openalex-snapshot
Incidence and Arrangement Problems
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_25openalex-snapshot
Finding squares and rectangles in sets of points
inferred← citeshttps://doi.org/10.1007/978-1-4612-0963-8_7openalex-snapshot
Finite Sets of Points
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/bf01931281openalex-snapshot
Finding squares and rectangles in sets of points
inferred← citeshttps://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferred← citeshttps://doi.org/10.1007/s00454-002-2896-zopenalex-snapshot
The k Most Frequent Distances in the Plane
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00177-xopenalex-snapshot
Furthest neighbours in space
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90065-dopenalex-snapshot
Computing the k-relative neighborhood graphs in Euclidean plane
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90069-9openalex-snapshot
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50019-1openalex-snapshot
10.1016/b978-044488002-4/50019-1
inferred← citeshttps://doi.org/10.1109/5.163414openalex-snapshot
Relative neighborhood graphs and their relatives
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.11575/cdm.v8i1.62120openalex-snapshot
An improved bound on the number of point-surface incidences in three dimensions
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a14openalex-snapshot
Incidences with $k$-non-degenerate sets and their applications
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4987openalex-snapshot
An improved bound on the number of point-surface incidences in three dimensions
inferred← citeshttps://doi.org/10.7282/t3qj7m8topenalex-snapshot
Some applications of algebraic methods in combinatorial geometry
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.