Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 1992Open Access

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

View Full Paper
Ask AI
Bookmark
Share

Authors

CSChristian SchwarzUniversity of FreiburgMSMichiel SmidJagiellonian UniversityJSJack SnoeyinkUniversity of North Carolina at Chapel Hill

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Schwarz et al. (1992) studied this question.

synapsesocial.com/papers/6a152ea2814bf8ec9a4e326dhttps://doi.org/10.1145/142675.142742
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Maintaining the minimal distance of a point set in polylogarithmic time1991 · 7 citations
  2. 2Closest-point problems1975 · 1,068 citations
  3. 3Maintaining the minimal distance of a point set in less than linear time1990 · 24 citations
  4. 4Computational Geometry--An Introduction.1986 · 4,264 citations