11th ACM Symposium on Computational Geometry. Selected papers from the symposium held in Vancouver, Canada, June 5--7, 1995 (Q1356936)

The preceding conferences (9, 1993) and (10, 1994) have been reviewed (see Zbl 0810.00027 and Zbl 1133.52300). Contents: David Avis, David Bremner and Raimund Seidel, How good are convex hull algorithms? (265--301); Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari and Francesco Vargiu, An experimental comparison of four graph drawing algorithms (303--325); Bernard Chazelle, David P. Dobkin, Nadia Shouraboura and Ayellet Tal, Strategies for polyhedral surface decomposition: an experimental study (327--342); Herbert Edelsbrunner and Roman Waupotitsch, A combinatorial approach to cartograms (343--360); Peter Su and Robert L. Scot Drysdale, A comparison of sequential Delaunay triangulation algorithms (361--385); Frank Wagner and Alexander Wolff, A practical map labeling algorithm (387--404). The articles will be reviewed individually.