Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) (+code) free download online
Title: Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) (+code) Author(s): Joseph O'Rourke Pages: 392 Publisher: Cambridge University Press; 2 edition Publication date: 1998 Language: English Format: PDF, DJVU ISBN-10: 0521640105 ISBN-13: Description: This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
Table of Contents
Preface
1 Polygon Triangulation
1.1 Art Gallery Theorems
1.2 Triangulation: Theory
1.3 Area of Polygon
1.4 Implementation Issues
1.5 Segment Intersection
1.6 Triangulation: Implementation
2 Polygon Partitioning
2.1 Monotone Partitioning
2.2 Trapezoidalization
2.3 Partition into Monotone Mountains
2.4 Linear-Time Triangulation
2.5 Convex Partitioning
3 Convex Hulls in Two Dimensions
3.1 Definitions of Convexity and Convex Hulls
3.2 Naive Algorithms for Extreme Points
3.3 Gift Wrapping
3.4 QuickHull
3.5 Graham's Algorithm
3.6 Lower Bound
3.7 Incremental Algorithm
3.8 Divide and Conquer
3.9 Additional Exercises
4 Convex Hulls in Three Dimensions
4.1 Polyhedra
4.2 Hull Algorithms
4.3 Implementation of Incremental Algorithm
4.4 Polyhedral Boundary Representations
4.5 Randomized Incremental Algorithm
4.6 Higher Dimensions
4.7 Additional Exercises
5 Voronoi Diagrams
5.1 Applications: Preview
5.2 Definitions and Basic Properties
5.3 Delaunay Triangulations
5.4 Algorithms
5.5 Applications in Detail
5.6 Medial Axis
5.7 Connection to Convex Hulls
5.8 Connection to Arrangements
6 Arrangements
6.1 Introduction
6.2 Combinatorics of Arrangements
6.3 Incremental Algorithm
6.4 Three and Higher Dimensions
6.5 Duality
6.6 Higher-Order Voronoi Diagrams
6.7 Applications
6.8 Additional Exercises
7 Search and Intersection
7.1 Introduction
7.2 Segment-Segment Intersection
7.3 Segment-Triangle Intersection
7.4 Point in Polygon
7.5 Point in Polyhedron
7.6 Intersection of Convex Polygons
7.7 Intersection of Segments
7.8 Intersection of Nonconvex Polygons
7.9 Extreme Point of Convex Polygon
7.10 Extremal Polytope Queries
7.11 Planar Point Location
8 Motion Planning
8.1 Introduction
8.2 Shortest Paths
8.3 Moving a Disk
8.4 Translating a Convex Polygon
8.5 Moving a Ladder
8.6 Robot Arm Motion
8.7 Separability
9 Sources
9.1 Bibliographies and FAQ's
9.2 Textbooks
9.3 Book Collections
9.4 Monographs
9.5 Journals
9.6 Conference Proceedings
9.7 Software
Bibliography
Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) (+code) free download links:
Title: Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) (+code)