English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

An Optimal Algorithm for the On-line Closest-pair Problem

MPS-Authors
/persons/resource/persons45433

Schwarz,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Schwarz, C., Smid, M., & Snoeyink, J. (1992). An Optimal Algorithm for the On-line Closest-pair Problem. In Proceedings of the 8th Annual Symposium on Computational Geometry (pp. 330-336). New York, NY: ACM.


Cite as: https://hdl.handle.net/21.11116/0000-000E-4CD3-F
Abstract
There is no abstract available