Approximation Algorithms for the Bottleneck Stretch Factor Problem

Computational geometry: an introduction

Computational geometry: an introduction

Ray shooting and parametric search

SIAM Journal on Computing

A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)

Dealing with higher dimensions: the well-separated pair decomposition and its applications

Dealing with higher dimensions: the well-separated pair decomposition and its applications

Euclidean spanners: short, thin, and lanky

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Algorithms for proximity problems in higher dimensions

Computational Geometry: Theory and Applications

On enumerating and selecting distances

Proceedings of the fourteenth annual symposium on Computational geometry

Faster algorithms for some geometric graph problems in higher dimensions

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Introduction to Algorithms

Introduction to Algorithms

Approximating the Stretch Factor of Euclidean Graphs

SIAM Journal on Computing