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

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Christian Schwarz
Michiel Smid
Jack Snoeyink
Published in:
· Proceeding
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Pages 330-336
ACM New York, NY, USA ©1992
table of contents ISBN:0-89791-517-8 doi>10.1145/142675.142742
An optimal algorithm for the on-line closest-pair problem Published by ACM 1992 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 14
· Downloads (cumulative): 370
· Citation Count: 6


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder