Combinatorial Geometry with Algorithmic Applications The Alcala Lectures János Pach

[1]  J. Steiner.  Einige Gesetze über die Theilung der Ebene und des Raumes. , 1826 .

[2]  R. Rado.  Note on Combinatorial Analysis , 1945 .

[3]  Ernst Witt.  Ein kombinatorischer Satz der Elementargeometrie , 1952 .

[4]  H. Warren.  Lower bounds for approximation by nonlinear manifolds , 1968 .

[5]  V. C. Williams,et al.  A Proof of Sylvester's Theorem on Collinear Points , 1968 .

[6]  W. T. Tutte.  Toward a theory of crossing numbers , 1970 .

[7]  Robert A. Schumacker,et al.  A Characterization of Ten Hidden-Surface Algorithms , 1974, CSUR.

[8]  T. Zaslavsky.  Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[9]  J. E. Wetzel.  On the Division of the Plane by Lines , 1978 .

[10]  Kym S. Watson.  Sylvester's problem for spreads of curves , 1980 .

[11]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[12]  Endre Szemerédi,et al.  A Combinatorial Distinction Between the Euclidean and Projective Planes , 1983, Eur. J. Comb..

[13]  Rolf Schneider.  Tessellations generated by hyperplanes , 1987, Discret. Comput. Geom..

[14]  Arie Tamir,et al.  Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures , 1988, SIAM J. Discret. Math..

[15]  Sivan Toledo,et al.  Extremal polygon containment problems , 1991, SCG '91.

[16]  Roberto Tamassia,et al.  Efficient Point Location in a Convex Spatial Cell-Complex , 1989, SIAM J. Comput..

[17]  Sinisa T. Vrecica,et al.  The Colored Tverberg's Problem and Complexes of Injective Functions , 1992, J. Comb. Theory A.

[18]  Micha Sharir,et al.  A simple output-sensitive algorithm for hidden surface removal , 1992, TOGS.

[19]  Peter Robinson,et al.  Drawability of Complete Graphs Using a Minimal Slope Set , 1994, Comput. J..

[20]  Raimund Seidel,et al.  The Nature and Meaning of Perturbations in Geometric Computing , 1994, STACS.

[21]  László A. Székely,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[22]  Binhai Zhu,et al.  Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time , 1997, Comput. Geom..

[23]  Micha Sharir,et al.  An Improved Bound for k-Sets in Three Dimensions , 2000, SCG '00.

[24]  Subhash Suri,et al.  Geometric permutations of balls with bounded size disparity , 2001, Comput. Geom..

[25]  Marcus Schaefer,et al.  Recognizing string graphs in NP , 2002, STOC '02.

[26]  József Solymosi,et al.  Distinct distances in high dimensional homogeneous sets , 2003 .

[27]  D. T. Lee,et al.  Point Set pattern matching ind-dimensions , 2005, Algorithmica.

[28]  Micha Sharir,et al.  Ray shooting and stone throwing with near-linear storage , 2005, Comput. Geom..

[29]  Fulvia Spaggiari,et al.  An infinite sequence of non-realizable weavings , 2005, Discret. Appl. Math..

[30]  Shakhar Smorodinsky,et al.  On The Chromatic Number of Geometric Hypergraphs , 2007, SIAM J. Discret. Math..

[31]  D A N I E L R A T N E R A N D M A N F R E D W A R M,et al.  The ( n 2-1 )-Puzzle and Related Relocation Problems , 2008 .