You have Guest access.
Log In
Michiel Smid
Journal Article
Maintaining the minimal distance of a point set in polylogarithmic time
Discrete & Computational Geometry, 1992, Volume 7, Number 1, Pages 415-431
An optimal algorithm for the on-line closest-pair problem
C. Schwarz, M. Smid and J. Snoeyink
Algorithmica, 1994, Volume 12, Number 1, Pages 18-29
Book Chapter
Dynamic partition trees
Haijo Schipper and Mark H. Overmars
Lecture Notes in Computer Science, 1990, Volume 447, SWAT 90, Pages 404-417
Applying the Q n Estimator Online
Robin Nunkesser, Karen Schettlinger and Roland Fried
Studies in Classification, Data Analysis, and Knowledge Organization, 2008, Data Analysis, Machine Learning and Applications, IV, Pages 277-284
Selection in monotone matrices and computing kth nearest neighbors
Pankaj K. Agarwal and Sandeep Sen
Lecture Notes in Computer Science, 1994, Volume 824, Algorithm Theory — SWAT '94, Pages 13-24
Maintaining range trees in secondary memory extended abstract
Mark H. Overmars and Michiel H. M. Smid
Lecture Notes in Computer Science, 1988, Volume 294, STACS 88, Pages 38-51
Iterated nearest neighbors and finding minimal polytopes
David Eppstein and Jeff Erickson
Discrete & Computational Geometry, 1994, Volume 11, Number 1, Pages 321-350
On the Power of the Semi-Separated Pair Decomposition
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi and Michiel Smid
Lecture Notes in Computer Science, 2009, Volume 5664, Algorithms and Data Structures, Pages 1-12
Dynamic planar point location with optimal query time Extended abstract
Franco P. Preparata and Roberto Tamassia
Lecture Notes in Computer Science, 1989, Volume 349, STACS 89, Pages 84-95
Applications of a semi-dynamic convex hull algorithm
John Hershberger and Subhash Suri
Lecture Notes in Computer Science, 1990, Volume 447, SWAT 90, Pages 380-392
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info