On the public citation graph

Geometric Problems with Application to Hashing

0 signed · 17 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.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(73)90020-3openalex-snapshot
On the identification of the convex hull of a finite set of points in the plane
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.1145/359863.359887openalex-snapshot
Perfect hashing functions

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.4380120708openalex-snapshot
Hash‐bucket search: A fast technique for searching an english spelling dictionary
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_41openalex-snapshot
Output-Sensitive Algorithms for Uniform Partitions of Points
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_79openalex-snapshot
Algorithms for projecting points to give the most uniform distribution with applications to hashing
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_83openalex-snapshot
Usefulness of angle-sweep over line-sweep
inferred← citeshttps://doi.org/10.1007/978-1-4612-5545-1_7openalex-snapshot
Mapping to Cells: Extension of a Data Structure for Fast Storage and Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_7openalex-snapshot
Hyperplane Approximation and Related Topics
inferred← citeshttps://doi.org/10.1007/bf01190156openalex-snapshot
Algorithms for projecting points to give the most uniform distribution with applications to hashing
inferred← citeshttps://doi.org/10.1007/s00453-001-0084-9openalex-snapshot
Improved Algorithms for Uniform Partitions of Points
inferred← citeshttps://doi.org/10.1016/0167-8655(94)90148-1openalex-snapshot
Application of geometric hashing to iconic database retrieval
inferred← citeshttps://doi.org/10.1016/s0262-8856(96)01114-6openalex-snapshot
Indexing pictorial documents by their content: a survey of current techniques
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00128-1openalex-snapshot
Translating a regular grid over a point set
inferred← citeshttps://doi.org/10.1137/0215044openalex-snapshot
Collections of Functions for Perfect Hashing
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.