An optimal algorithm for closest pair maintenance (extended abstract)

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Sergei N. Bespamyatnikh Department of Mathematics and Mechanics, Ural State University, 51 Lenin St., Ekaterinburg 620083, Russia
Published in:
Cover Image
 
· Proceeding
SCG '95 Proceedings of the eleventh annual symposium on Computational geometry
Pages 152 - 161
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-724-3 doi>10.1145/220279.220296
An optimal algorithm for closest pair maintenance (extended abstract) Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 379
· Citation Count: 9


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