Table of Contents

• Preface [doi]
• Davenport-Schinzel Sequences and Their Geometric ApplicationsPankaj K. Agarwal, Micha Sharir. 1-47 [doi]
• Arrangements and Their ApplicationsPankaj K. Agarwal, Micha Sharir. 49-119 [doi]
• Discrete Geometric Shapes: Matching, Interpolation, and ApproximationHelmut Alt, Leonidas J. Guibas. 121-153 [doi]
• Deterministic Parallel Computational GeometryMikhail J. Atallah, Danny Z. Chen. 155-200 [doi]
• Voronoi DiagramsFranz Aurenhammer, Rolf Klein. 201-290 [doi]
• Mesh GenerationMarshall W. Bern, Paul E. Plassmann. 291-332 [doi]
• Applications of Computational Geometry to Geographic Information SystemsLeila De Floriani, Paola Magillo, Enrico Puppo. 333-388 [doi]
• Making Geometry Visible: An Introduction to the Animation of Geometric AlgorithmsAlejo Hausner, David P. Dobkin. 389-423 [doi]
• Spanning Trees and SpannersDavid Eppstein. 425-461 [doi]
• Geometric Data StructuresMichael T. Goodrich, Kumar Ramaiyer. 463-489 [doi]
• Polygon DecompositionJ. Mark Keil. 491-518 [doi]
• Link Distance ProblemsAnil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev. 519-558 [doi]
• Derandomization in Computational GeometryJirí Matousek 0001. 559-595 [doi]
• Robustness and Precision Issues in Geometric ComputationStefan Schirra. 597-632 [doi]
• Geometric Shortest Paths and Network OptimizationJoseph S. B. Mitchell. 633-701 [doi]
• Randomized Algorithms in Computational GeometryKetan Mulmuley. 703-724 [doi]
• Spatial Data Structures: Concepts and Design ChoicesJürg Nievergelt, Peter Widmayer. 725-764 [doi]
• Parallel Computational Geometry: An Approach using RandomizationJohn H. Reif, Sandeep Sen. 765-828 [doi]
• Visibility in the PlaneTetsuo Asano, Subir Kumar Ghosh, Thomas C. Shermer. 829-876 [doi]
• Closest-Point Problems in Computational GeometryMichiel Smid. 877-935 [doi]
• Graph DrawingRoberto Tamassia. 937-971 [doi]
• Art Gallery and Illumination ProblemsJorge Urrutia. 973-1027 [doi]