Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

103

Voted

CCCG
1993

66views Computational Geometry» more CCCG 1993»

Simple Randomized Algorithms for Closest Pair Problems

15 years 4 months ago

Simple Randomized Algorithms for Closest Pair Problems

Download people.scs.carleton.ca

Mordecai J. Golin, Rajeev Raman, Christian Schwarz

Real-time Traffic

CCCG 1993 | CCCG 2007 |

claim paper

Related Content

» Randomized Data Structures for the Dynamic ClosestPair Problem

» Optimal hash functions for approximate closest pairs on the ncube

» Closest Pair Queries in Spatial Databases

» Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs

» A LinearTime Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

» Closest Pair Queries with Spatial Constraints

» Kinetic and dynamic data structures for closest pair and all nearest neighbors

» Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm vi...

» The Trimmed Iterative Closest Point Algorithm

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	CCCG
Authors	Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid

Comments (0)