Computational Geometry in C

Front Cover
Cambridge University Press, Oct 13, 1998 - Computers - 376 pages
4 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

II
1
III
11
IV
16
V
24
VI
27
VII
32
VIII
44
X
47
XXXVII
169
XXXVIII
179
XXXIX
182
XL
191
XLI
193
XLII
194
XLIII
199
XLIV
201

XI
51
XII
56
XIII
58
XIV
63
XV
64
XVI
66
XVII
68
XVIII
69
XIX
72
XX
87
XXI
88
XXII
91
XXIII
96
XXIV
101
XXVI
109
XXVII
117
XXVIII
146
XXIX
149
XXX
150
XXXI
153
XXXII
155
XXXIV
157
XXXV
161
XXXVI
165
XLVI
205
XLVII
209
XLVIII
218
XLIX
220
L
226
LI
239
LII
245
LIII
252
LIV
264
LV
266
LVI
269
LVII
272
LVIII
285
LIX
294
LX
295
LXI
300
LXII
302
LXIII
313
LXIV
322
LXV
347
LXVI
351
LXVII
361
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 351 - A. Aggarwal, LJ Guibas, J. Saxe, and PW Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput.

References to this book

All Book Search results »

Bibliographic information