Some of the older papers by J. Matousek
This page contains some papers which might be difficult to access in libraries.
The files may contain errors which are corrected in the printed versions.
These are mostly compressed postscript files (use "gunzip "
before sending to a postscript printer). With the U.S. paper format, people
sometimes have problems printing some of the files. If this happens to
you, please send me an e-mail, I'll reformat the relevant paper or send
you a TeX file.
Jiri Matousek's home page
points in rotating convex bodies
with Imre Barany (Discrete and Computational
Geometry -- The Goodman-Polack Festschrift (B. Aronov, S.
Basu, J. Pach, M. Sharir, eds)
- Low-distortion embeddings of trees with
Robert Babilon, Jana Maxova, and Pavel Valtr (Proc. Graph Drawing 2002)
- Low-distortion embeddings
of finite metric spaces with Piotr Indyk, a chapter
for the new edition of the Handbook of Discrete and Computational Geometry
- Nonexistence of 2-reptile simplices
Berge's theorem, fractional Helly, and art galleries
with Imre Barany, in a special volume dedicated to Claude Berge
Discrepancy of Point Sequences on Fractal Sets,
with H. Albrecher and R. Tichy, Publicationes Mathematicae Debrecen
(special volume dedicated to K. Gyori)
Mathematical snapshots from the computational geometry landscape (short survey;
in Proc. ICM 1998)
Geometric set systems - a survey (VC-dimension etc.), in Proc. 2nd. European
Derandomization in computational geometry - a survey,
Handbook of Computational Geometry (J. R. Sack ed.)
On enclosing k points by a circle
Information Processing Letters 53(1995) 217-221.
Dynamic half-space range reporting
and its applications with P.K. Agarwal (Algorithmica)
Reporting points in halfspaces
Bi-Lipschitz embeddings into low-dimensional
Hercules versus Hidden Hydra Helper (with M. Loebl)
Note on bi-Lipschitz embeddings into normed spaces
Ramsey-like properties for bi-Lipschitz mappings
of finite metric spaces
Computing the center of planar point sets
Geometric range searching (the version printed
in ACM Comput. Surveys is rather distorted)
How to Net a Lot with Little: Small Epsilon-Nets
for Disks and Halfspaces with R. Seidel and E. Welzl - the published
version has a substantial gap in the proof, and here it is (hopefully)
On Lipschitz mappings onto a square
The complexity of the lower envelope of segments with
h endpoints (with Pavel Valtr)