Papers
- Chapters
from Boissonnat & Yvinec ' book, such as triangulations
in 2D and 3D.
- A
Replacement for Voronoi Diagrams of Near Linear Size, by Sariel
Har-Peled Focs 2001
http://valis.cs.uiuc.edu/~sariel/papers/01/avoronoi/avoronoi.html
- An
optimal algorithm for approximate nearest neighbor searching
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, Journal
of the ACM, 45 (1998), 891-923.
ftp://ftp.cs.umd.edu/pub/faculty/mount/Papers/dist.ps.gz
- Geometric
spanner for routing in mobile networks J. Gao, L. Guibas, J. Hershberger,
L. Zhang, and A. Zhu. Accepted to ACM Symposium on Mobile Ad Hoc
Networking and Computing, 2001
http://graphics.stanford.edu/~lizhang/papers/myriad-c.ps
- Discrete
mobile centers J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu
Proceedings of 17th ACM Symposium on Computational Geometry, pp. 188-196,
2001
http://graphics.stanford.edu/~lizhang/papers/routing-c.ps
- An
Efficient Algorithm for Terrain Simplification, P. Agarwal, P. Desikan, in
8th ACM-SIAM Symp. Discrete Algorithms,, 1997
http://www.cs.duke.edu/~pankaj/papers/terrain.ps.gz
- I/O-Efficient
algorithms for contour line extraction and planar graph blocking, P.
Agarwal, L. Arge, T.M. Murali, K.
Varadarajan, and J.S. Vitter, in 9th ACM-SIAM Symp. Discrete Algorithms,
1998.
http://www.cs.duke.edu/~pankaj/papers/contour.ps.gz
- Indexing
moving points, P. Agarwal, L. Arge
and J. Erickson, in ACM Symp. on Principles of Database Systems, 2000.
http://www.cs.duke.edu/~pankaj/papers/kinetic-range.ps.gz