Surface reconstruction by Voronoi filtering.
Nina Amenta and Marshall Bern.
Discrete \& Computational Geometry, 22:481--504, 1999.
Preliminary version in SoCG'98: Proceedings of the Fourteenth Annual Symposium on Computational Geometry,

Plongements Lipschitziens dans `r^n`.
P. Assouad.
Bulletin de la Societe Mathematique de France, 111:429--448, 1983.

Finite normalized tight frames.
John J. Benedetto and Matthew Fickus.
Advances in Computational Mathematics, 18(2-4):357--385, 2003.

The shortest path through many points.
J. Beardwood, J. Halton, and J. Hammersley.
Proceedings of the Cambridge Philosophical Society, 55:299--327, 1959.

Towards a theoretical foundation for Laplacian based manifold methods.
M. Belkin and P. Niyogi.
Journal of Computer and System Sciences, 2007.
Preliminary version in Proc. of Computational Learning Theory,

Spanners with slack.
T.-H. Hubert Chan, Michael Dinitz, and Anupam Gupta.
In ESA'06: Proceedings of the 14th Annual European Symposium on Algorithms, pages 196--207, London, UK, 2006. Springer-Verlag.

Geodesic entropic graphs for dimension and entropy estimation in manifold learning.
J. Costa and A. O. Hero.
IEEE Trans. Signal Proc., 2004.

Nearest neighbor queries in metric spaces.
K. L. Clarkson.
Discrete \& Computational Geometry, 22:63--93, 1999.
Preliminary version in STOC '97: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997.

Building triangulations using `\epsilon`-nets.
Kenneth L. Clarkson.
In STOC '06: Proceedings of the Thirty-Eighth Annual ACM Symposium on the Theory of Computing, pages 326--335, New York, NY, USA, 2006. ACM.

Random projection trees and low dimensional manifolds.
S. Dasgupta and Y. Freund.
In STOC '08: Proceedings of the Fortieth Annual ACM Symposium on the Theory of Computing, 2008.

Geometry of cuts and metrics.
M. Deza and M. Laurent.
Springer-Verlag, New York, 1997.

Topological estimation using witness complexes.
V. de Silva and G. Carlsson.
In Symposium on Point-Based Graphics, 2004.

Fractal geometry - mathematical foundations and applications.
K. J. Falconer.
J. Wiley \& Sons, Hoboken, NJ, 1990.

Geometric measure theory.
H. Federer.
Springer-Verlag, New York, 1969.

Reconstruction using witness complexes.
Leonidas J. Guibas and Steve Y. Oudot.
In SODA '07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1076--1085, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.

Clustering to minimize the maximum intercluster distance.
T. Gonzalez.
Theoretical Computer Science, 38:293--306, 1985.

Shape dimension and intrinsic metric from samples of manifolds with high co-dimension.
J. Giesen and U. Wagner.
In SoCG '03: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pages 329--337, 2003.

Geometric embeddings of metric spaces.
J. Heinonen.
Technical report, University of Jyv\"askyl\"a, Finland, 2003. \verb+http://www.math.jyu.fi/tutkimus/ber.html+.

Optimal triangulation and quadric-based surface simplification.
Paul S. Heckbert and Michael Garland.
Comput. Geom. Theory Appl., 14(1-3):49--65, 1999.

Fast construction of nets in low dimensional metrics, and their applications.
S. Har-Peled and M. Mendel.
In SoCG '05: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, 2005.

A best possible heuristic for the `k`-center problem.
D. S. Hochbaum and D. B. Shmoys.
Mathematics of Operations Research, 10:180--184, 1985.

Discretizing manifolds via minimum energy points.
D. P. Hardin and E. B. Saff.
Notices of the AMS, 51(10):1186--1194, 2004.

Nearest-neighbor-preserving embeddings.
Piotr Indyk and Assaf Naor.
ACM Transactions on Algorithms, 3(3), 2007.

Navigating nets: simple algorithms for proximity search.
R. Krauthgamer and J. R. Lee.
In SODA '04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 798--807. Society for Industrial and Applied Mathematics, 2004.

A new theory of dimension.
D.G. Larman.
Proc. London Math. Soc. (3rd Series), pages 178--192, 1967.

On the relationship between classical grid search and probabilistic roadmaps.
Steven M. LaValle, Michael S. Branicky, and Stephen R. Lindemann.
The International Journal of Robotics Research, 23(7--8):673--692, 2004.

Similarity search via combinatorial nets.
Y. Lifshits and S. Zhang.
2008.

The online median problem.
Ramgopal R. Mettu and C. Greg Plaxton.
SIAM Journal on Computing, 32(3):816--832, 2003.
Preliminary version in FOCS '00: Proceedings of the Forty-First Annual {IEEE} Symposium on Foundations of Computer Science,