No label defined (Q4936005)

[The articles of this volume will be reviewed individually.] This handbook presents chapters which survey in detail most of the research available to date in this field. The handbook contains survey papers in the following fundamental topics: Arrangements, Voronoi diagrams, Geometric data structures (incl. point location, convex hulls, etc.), Spatial data structures, Polygon decomposition, Randomized algorithms, Derandomization, Parallel computational geometry (deterministic and randomized), Visibility, Art Gallery and illumination problems, Link distance problems, Similarity of geometric objects, Davenport-Schinzel sequences, and Spanning trees and spanners. There are also three chapters devoted to applications of Computational Geometry to other fields of science: Geographical information systems, geometric shortest paths and network optimization, and Mesh generation. In addition, there is a chapter devoted to robustness and numerical issues, and chapters on Animation and Graph drawing. Indexed articles: \textit{Agarwal, Pankaj K.; Sharir, Micha}, Davenport-Schinzel sequences and their geometric applications, 1-47 [Zbl 0952.68148] \textit{Agarwal, Pankaj K.; Sharir, Micha}, Arrangements and their applications, 49-119 [Zbl 0948.52011] \textit{Alt, Helmut; Guibas, Leonidas J.}, Discrete geometric shapes: Matching, interpolation, and approximation, 121-153 [Zbl 0995.65023] \textit{Atallah, Mikhail J.; Chen, Danny Z.}, Deterministic parallel computational geometry, 155-200 [Zbl 0970.65020] \textit{Aurenhammer, Franz; Klein, Rolf}, Voronoi diagrams, 201-290 [Zbl 0995.65024] \textit{Bern, Marshall; Plassmann, Paul}, Mesh generation, 291-332 [Zbl 0995.65025] \textit{de Floriani, Leila; Magillo, Paola; Puppo, Enrico}, Applications of computational geometry to geographic information systems, 333-388 [Zbl 0970.65018] \textit{Hausner, Alejo; Dobkin, David P.}, Making geometry visible: An introduction to the animation of geometric algorithms, 389-423 [Zbl 0942.68744] \textit{Eppstein, David}, Spanning trees and spanners, 425-461 [Zbl 0944.05021] \textit{Goodrich, Michael T.; Ramaiyer, Kumar}, Geometric data structures, 463-489 [Zbl 0970.65021] \textit{Keil, J. Mark}, Polygon decomposition, 491-518 [Zbl 0948.68189] \textit{Maheshwari, Anil; Sack, Jörg-Rüdiger; Djidjev, Hristo N.}, Link distance problems, 519-558 [Zbl 0953.68138] \textit{Matoušek, Jiří}, Derandomization in computational geometry, 559-595 [Zbl 0995.65026] \textit{Schirra, Stefan}, Robustness and precision issues in geometric computation, 597-632 [Zbl 0947.68153] \textit{Mitchell, Joseph S. B.}, Geometric shortest paths and network optimization, 633-701 [Zbl 0941.68137] \textit{Mulmuley, Ketan}, Randomized algorithms in computational geometry, 703-724 [Zbl 0995.65027] \textit{Nievergelt, Jürg; Widmayer, Peter}, Spatial data structures: Concepts and design choices, 725-764 [Zbl 0944.68184] \textit{Reif, John H.; Sen, Sandeep}, Parallel computational geometry: An approach using randomization, 765-828 [Zbl 0970.65022] \textit{Asano, Tetsuo; Ghosh, Subir K.; Shermer, Thomas C.}, Visibility in the plane, 829-876 [Zbl 0948.68194] \textit{Smid, Michiel}, Closest-point problems in computational geometry, 877-935 [Zbl 0995.65028] \textit{Tamassia, Roberto}, Graph drawing, 937-971 [Zbl 0959.05031] \textit{Urrutia, Jorge}, Art gallery and illumination problems, 973-1027 [Zbl 0941.68138]