On the public citation graph

An optimal algorithm for the on-line closest-pair problem

https://doi.org/10.1007/bf01377181
0 signed · 41 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-54945-5_80openalex-snapshot
Rectangular point location and the dynamic closest pair problem
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferredcites →https://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1142/s0218195992000044openalex-snapshot
ENUMERATING INTERDISTANCES IN SPACE
inferredcites →https://doi.org/10.1145/109648.109674openalex-snapshot
Enumerating k distances for n points in the plane
inferredcites →https://doi.org/10.1145/142675.142742openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
inferredcites →https://doi.org/10.1145/800113.803652openalex-snapshot
Divide-and-conquer in multidimensional space
inferredcites →https://doi.org/10.22028/d291-26452openalex-snapshot
Maintaining the minimal distance of a point set in less than linear time
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.5555/320176.320185openalex-snapshot
New techniques for some dynamic closest-point and farthest-point problems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1997.0873openalex-snapshot
A Reliable Randomized Algorithm for the Closest-Pair Problem
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_21openalex-snapshot
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_2openalex-snapshot
Dynamic Compressed Hyperoctrees with Application to the N-body Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_46openalex-snapshot
Adaptive Spatial Partitioning for Multidimensional Data Streams
inferred← citeshttps://doi.org/10.1007/s00453-005-1197-3openalex-snapshot
I/O-Efficient Well-Separated Pair Decomposition and Applications
inferred← citeshttps://doi.org/10.1007/s00453-006-0070-3openalex-snapshot
Adaptive Spatial Partitioning for Multidimensional Data Streams
inferred← citeshttps://doi.org/10.1007/s004530010047openalex-snapshot
Linear Size Binary Space Partitions for Uncluttered Scenes
inferred← citeshttps://doi.org/10.1007/s00778-012-0266-xopenalex-snapshot
Spatial query processing for fuzzy objects
inferred← citeshttps://doi.org/10.1007/s10623-014-9920-1openalex-snapshot
On small line sets with few odd-points
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.sigpro.2012.02.002openalex-snapshot
Joint fingerprinting and decryption with noise-resistant for vector quantization images
inferred← citeshttps://doi.org/10.1016/j.sigpro.2013.11.011openalex-snapshot
Reversible joint fingerprinting and decryption based on side match vector quantization
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00321-0openalex-snapshot
Walking around fat obstacles
inferred← citeshttps://doi.org/10.1093/ietisy/e90-d.9.1422openalex-snapshot
Reversible Data Hiding in the VQ-Compressed Domain
inferred← citeshttps://doi.org/10.1109/bwcca.2010.115openalex-snapshot
Noise-Resistant Joint Fingerprinting and Decryption Based on Vector Quantization
inferred← citeshttps://doi.org/10.1137/s0097539793259458openalex-snapshot
New Techniques for Exact and Approximate Dynamic Closest-Point Problems
inferred← citeshttps://doi.org/10.1137/s0097539794277718openalex-snapshot
Randomized Data Structures for the Dynamic Closest-Pair Problem
inferred← citeshttps://doi.org/10.1145/1435375.1435379openalex-snapshot
Kinetic and dynamic data structures for closest pair and all nearest neighbors
inferred← citeshttps://doi.org/10.1145/2483699.2483702openalex-snapshot
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
inferred← citeshttps://doi.org/10.1145/293347.293348openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
inferred← citeshttps://doi.org/10.1145/351827.351829openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
inferred← citeshttps://doi.org/10.1145/3617326openalex-snapshot
Closest Pairs Search Over Data Stream
inferred← citeshttps://doi.org/10.1201/9781584888215-c2openalex-snapshot
Computational Geometry II
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.60openalex-snapshot
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem
inferred← citeshttps://doi.org/10.5555/313559.313784openalex-snapshot
Randomized data structures for the dynamic closest-pair problem
inferred← citeshttps://doi.org/10.5555/314613.315030openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
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.