Abstract
The recent development of a theory of computational-geometric sampling has revolutionized the design of geometric algorithms, and led to the solution of some of the most outstanding problems in the field. Much of this development owes to the interplay between computational geometry and discrepancy theory. This talk will discuss some intriguing aspects of this development, including the use of data structuring ideas to prove theorems in discrepancy theory.
This is a preview of subscription content, log in via an institution to check access.
References
Chazelle, B. Computational geometry: a retrospective, in “Computing in Euclidean Geometry” (2nd Edition), Eds. D.-Z. Du and F. Hwang, World Scientific Press (1995), 22–46.
Chazelle, B. Discrepancy and Derandomization, book in preparation, 1997.
Clarkson, K.L. Randomized geometric algorithms, in Computing in Euclidean Geometry, D.-Z. Du and F.K. Kwang ed., Lecture Notes Series on Comput. 1 (1992), World Scientific, 117–162.
Matoušek, J. Derandomization in computational geometry, J. Algorithms 20 (1996), 545–580.
Matoušek, J. Geometric Discrepancy, book in preparation, 1997.
Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chazelle, B. (1997). Discrepancy theory and computational geometry. In: Dehne, F., Rau-Chaplin, A., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63307-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-63307-3_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63307-5
Online ISBN: 978-3-540-69422-9
eBook Packages: Springer Book Archive