New trends in discrete and computational geometry (Q684910)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Guibas, Leonidas; Sharir, Micha}, Combinatorics and algorithms of arrangements, 9-36 [Zbl 0809.52020] \textit{Seidel, Raimund}, Backwards analysis of randomized geometric algorithms, 37-67 [Zbl 0834.68122] \textit{Matoušek, Jiří}, Epsilon-nets and computational geometry, 69-89 [Zbl 0801.68154] \textit{Khachiyan, Leonid}, Complexity of polytope volume computation, 91-101 [Zbl 0789.52016] \textit{Goodman, Jacob E.; Pollack, Richard}, Allowable sequences and order types in discrete and computational geometry, 103-134 [Zbl 0809.52026] \textit{Korneenko, Nikolai M.; Martini, Horst}, Hyperplane approximation and related topics, 135-161 [Zbl 0809.52013] \textit{Goodman, Jacob E.; Pollack, Richard; Wenger, Rephael}, Geometric transversal theory, 163-198 [Zbl 0792.52001] \textit{Bezdek, Károly}, Hadwiger-Levi's covering problem revisited, 199-233 [Zbl 0798.52004] \textit{Bárány, Imre}, Geometric and combinatorial applications of Borsuk's theorem, 235-249 [Zbl 0788.52012] \textit{Fejes Tóth, Gábor; Kuperberg, Wlodzimierz}, A survey of recent results in the theory of packing and covering, 251-279 [Zbl 0798.52020] \textit{Moser, W.; Pach, J.}, Recent developments in combinatorial geometry, 281-302 [Zbl 0796.51007] \textit{Komjáth, Péter}, Set theoretic constructions in Euclidean spaces, 303-325 [Zbl 0790.52004]