Logo

Login | Create Account

The Anatomy of a Geometric Algorithm

Matousek, Jirí (1999) The Anatomy of a Geometric Algorithm. [Conference Paper]

Full text not available from this repository.

Abstract

No Abstract

Item Type:Conference Paper
Classifications:Z Theory > Z.250 Geometry
ID Code:233
Deposited By:Maciejak, Agnes
Deposited On:23 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1731&spage=1

Repository Staff Only: item control page

References

1. A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes Comput. Sci., pages 265-276. Springer-Verlag, 1993.

2. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.

3. A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theor. Appl., 4:119-136, 1994.

4. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 64-73, 1993.

5. A. Gajentaan and M. H. Overmars. On a class of n^{2}-hard problems in computational geometry. Comput. Geom. Theor. Appl., 5(3):117-142, 1995.

6. J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press LLC, Boca Raton, FL, 1997.

7. J. Matousek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365-384, 1995.

8. J. Matousek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16:498-516, 1996.

9. J. Matousek. On enclosing k points by a circle. Information Processing Letters, 53:217-221, 1995.

10. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30:852-865, 1983.

11. J.-R. Sack and J. Urrutia, editors. Handbook on Computational Geometry. North-Holland, 1999. In press.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.