This article contains the speaker’s slides for the talk, reproduced by the editors with speaker’s permission. An appendix with references was prepared by the speaker.
Chapter PDF
References
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.
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theor. Appl., 4:119–136, 1994.
D. Eppstein and J. Erickson. Iterated nearest neighbors and nding minimal polytopes. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 64–73, 1993.
A. Gajentaan and M. H. Overmars. On a class of n2-hard problems in computational geometry. Comput. Geom. Theor. Appl., 5(3):117–142, 1995.
J. E. Goodman and J. O’Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press LLC, Boca Raton, FL, 1997.
J. Matoušek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365–384, 1995.
J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algoritmica, 16:498–516, 1996.
J. Matoušek. On enclosing k points by a circle. Information Processing Letters, 53:217–221, 1995.
N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30:852–865, 1983.
J.-R. Sack and J. Urrutia, editors. Handbook on Computational Geometry. North-Holland, 1999. In press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matoušek, J. (1999). The Anatomy of a Geometric Algorithm. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive