Geometric Approximation Algorithms

  title={Geometric Approximation Algorithms},
  author={Sariel Har-Peled},
The Peace of Olivia. How sweat and peaceful it sounds! There the great powers noticed for the first time that the land of the Poles lends itself admirably to partition. – The tin drum, Gunter Grass In this chapter, we are going to discuss two basic geometric algorithms. The first one, computes the closest pair among a set of n points in linear time. This is a beautiful and surprising result that exposes the computational power of using grids for geometric computation. Next, we discuss a simple… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 248 citations. REVIEW CITATIONS
161 Citations
82 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 161 extracted citations

248 Citations

Citations per Year
Semantic Scholar estimates that this publication has 248 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 82 references

volume MSRI Publ

  • K. Ball. An elementary introduction to modern convex geometry
  • 31. Cambridge Univ. Press,
  • 1997
Highly Influential
3 Excerpts

20th Annu

  • H. Yu, P. K. Agarwal, R. Poreddy, K. R. Varadarajan. Practical methods for shape fitting, kinetic data structures using core sets. In Proc
  • ACM Sympos. Comput. Geom., pages 263–272,
  • 2004

Faster coreset constructions and data stream algorithms in fixed dimensions

  • T. M. Chan
  • Proc. 20th Annu. ACM Sympos. Comput. Geom., pages…
  • 2004
2 Excerpts

Immorlica N

  • M. Datar
  • P. Indyk, and V. S. Mirrokni. Locality-sensitive…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…