Handbook of Discrete and Computational Geometry, Second Edition

Csaba D. Toth, Joseph O'Rourke, Jacob E. Goodman

Hardback
$143.96

April 13, 2004 by Chapman and Hall/CRC
Reference - 1560 Pages - 296 B/W Illustrations
ISBN 9781584883012 - CAT# C3014
Series: Discrete and Combinatorial Mathematics Series

FREE Standard Shipping!

was $179.95

$143.96

SAVE $35.99

Add to Cart
Add to Wish List

Features

  • Provides a one-stop reference both for researchers in geometry and geometric computing and for professionals who use geometric tools in their work
  • Covers a broad range of topics in discrete and computational geometry as well as numerous applications
  • Presents results in the forms of theorems, algorithms, and tables
  • Addresses many important new developments in the field, including solution of the Kepler conjecture, results on the 2-center problem, new bounds on k-sets and geometric permutations, and new art gallery theorems
  • Includes nearly 300 illustrations, almost 200 tables, and glossaries that provide clear definitions of more than 4000 terms

Summary

While high-quality books and journals in this field continue to proliferate, none has yet come close to matching the Handbook of Discrete and Computational Geometry, which in its first edition, quickly became the definitive reference work in its field. But with the rapid growth of the discipline and the many advances made over the past seven years, it's time to bring this standard-setting reference up to date.

Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of contributors, added manymore, and together thoroughly revised their work to make the most important results and methods, both classic and cutting-edge, accessible in one convenient volume. Now over more then 1500 pages, the Handbook of Discrete and Computational Geometry, Second Edition once again provides unparalleled, authoritative coverage of theory, methods, and applications.

Highlights of the Second Edition:

  • Thirteen new chapters: Five on applications and others on collision detection, nearest neighbors in high-dimensional spaces, curve and surface reconstruction, embeddings of finite metric spaces, polygonal linkages, the discrepancy method, and geometric graph theory
  • Thorough revisions of all remaining chapters
  • Extended coverage of computational geometry software, now comprising two chapters: one on the LEDA and CGAL libraries, the other on additional software
  • Two indices: An Index of Defined Terms and an Index of Cited Authors
  • Greatly expanded bibliographies