On the public citation graph
Maintaining the minimal distance of a point set in polylogarithmic time
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferredcites →https://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1007/bfb0028255openalex-snapshot
Shallow interdistance selection and interdistance enumeration
inferredcites →https://doi.org/10.1016/0196-6774(81)90025-0openalex-snapshot
Dynamization of order decomposable set problems
inferredcites →https://doi.org/10.1016/0304-3975(80)90018-3openalex-snapshot
On the average number of rebalancing operations in weight-balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1989.63523openalex-snapshot
Dynamically computing the maxima of decomposable functions, with applications
inferredcites →https://doi.org/10.1145/109648.109674openalex-snapshot
Enumerating k distances for n points in the plane
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.1007/3-540-57155-8_254openalex-snapshot
Static and dynamic algorithms for k-point clustering problems
inferred← citeshttps://doi.org/10.1007/978-981-95-5716-5_34openalex-snapshot
Continuous Top-k Skyline Pairs Query Over Data Stream
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf01377181openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
inferred← citeshttps://doi.org/10.1007/bf02523237openalex-snapshot
Efficient construction of a bounded-degree spanner with low weight
inferred← citeshttps://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferred← citeshttps://doi.org/10.1007/bf02574030openalex-snapshot
Dynamic Euclidean minimum spanning trees and extrema of binary functions
inferred← citeshttps://doi.org/10.1007/bfb0049396openalex-snapshot
Efficient construction of a bounded degree spanner with low weight
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(91)90001-uopenalex-snapshot
Off-line dynamic maintenance of the width of a planar point set
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
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.egypro.2011.12.168openalex-snapshot
An Efficient Data Structure for Dynamic Closest Pair Problem
inferred← citeshttps://doi.org/10.1109/icinfa.2011.5949045openalex-snapshot
Grid structures for efficient geometric algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267816openalex-snapshot
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
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/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.1145/262839.262998openalex-snapshot
Proximity problems on moving points
inferred← citeshttps://doi.org/10.1145/351827.351829openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
inferred← citeshttps://doi.org/10.11606/d.45.2000.tde-20220712-115327openalex-snapshot
Problemas dinâmicos em geometria computacional
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04259openalex-snapshot
Completeness in Polylogarithmic Time and Space
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.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
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.