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

Schwarz, Christian; Smid, Michiel; Snoeyink, Jack

doi:10.1145/142675.142742

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-4CD3-F Version Permalink: https://hdl.handle.net/21.11116/0000-000E-4CD4-E

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Schwarz, Christian¹, Author
Smid, Michiel¹, Author
Snoeyink, Jack², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1992

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1145/142675.142742
BibTex Citekey: Schwarz-et-al_SCG92

Degree: -

Event

show

hide

Title: 8th Annual Symposium on Computational Geometry

Place of Event: Berlin, Germany

Start-/End Date: 1992-06-10 - 1992-06-12

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 8th Annual Symposium on Computational Geometry

Abbreviation : SCG 1992

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, NY : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 330 - 336 Identifier: ISBN: 978-0-89791-517-5