Computational Geometry Algorithms and Applications

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Berg etc
Edition: 2
Publisher: Springer
Year: 2000

Language: English
Pages: 367

Contents......Page 6
1 Computational Geometry......Page 10
2 Line Segment Intersection......Page 27
3 Polygon Triangulation......Page 52
4 Linear Programming......Page 69
5 Orthogonal Range Searching......Page 101
6 Point Location......Page 127
7 Voronoi Diagrams......Page 153
8 Arrangements and Durality......Page 170
9 Delaunay Triangulations......Page 188
10 More Geometric Data Structures......Page 216
11 Convex Hulls......Page 239
12 Binary Space Partitions......Page 255
13 Robot Motion Planning......Page 270
14 Quadtrees......Page 294
15 Visibility Graphs......Page 310
16 Simplex Range Searching......Page 321
Bibliography......Page 342