Jacob E. Goodman

Janos Pach

Emo Welzl

This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.

Combinatorial and Computational Geometry

Joseph O'Rourke

Csaba D. Toth

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

Handbook of Discrete and Computational Geometry, Second Edition

Richard D. Pollack

William L. Steiger

The first DIMACS special year, held during 1989-1990, was devoted to discrete and computational geometry. More than 200 scientists, both long- and short-term visitors, came to DIMACS to participate in the special year activities. Among the highlights were six workshops at Rutgers and Princeton Universities that defined the focus for much of the special year. The workshops addressed the following topics: geometric complexity, probabilistic methods in discrete and computational geometry, polytopes and convex sets, arrangements, and algebraic and practical issues in geometric computation. This volume presents some of the results growing out of the workshops and the special year activities. Containing both survey articles and research papers, this collection presents an excellent overview of significant recent progress in discrete and computational geometry. The diversity of these papers demonstrate how geometry continues to provide a vital source of ideas in theoretical computer science and discrete mathematics as well as fertile ground for interaction and simulation between the two disciplines.

Papers from the DIMACS Special Year

Discrete and Computational Geometry

Richard Pollack

Bernard Chazelle

This volume is a collection of refereed expository and research articles in discrete and computational geometry written by leaders in the field. Articles are based on invited talks presented at the AMS-IMS-SIAM Summer Research Conference, ``Discrete and Computational Geometry: Ten Years Later'', held in 1996 at Mt. Holyoke College (So. Hadley, MA). Topics addressed range from tilings, polyhedra, and arrangements to computational topology and visibility problems. Included are papers on the interaction between real algebraic geometry and discrete and computational geometry, as well as on linear programming and geometric discrepancy theory.

Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry--Ten Years Later, July 14-18, 1996, Mount Holyoke College

Jacob E. Goodman

Books

Your next favorite book is out there