By Joseph O'Rourke

Whereas high quality books and journals during this box proceed to proliferate, none has but come with regards to matching the instruction manual of Discrete and Computational Geometry, which in its first version, quick grew to become the definitive reference paintings in its box. yet with the quick development of the self-discipline and the numerous advances remodeled the previous seven years, it is time to deliver this standard-setting reference as much as date.

Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of participants, extra manymore, and jointly completely revised their paintings to take advantage of very important effects and strategies, either vintage and state-of-the-art, available in a single handy quantity. Now over extra then 1500 pages, the guide of Discrete and Computational Geometry, moment variation once more presents unheard of, authoritative insurance of thought, tools, and applications.

Highlights of the second one Edition:

  • Thirteen new chapters: 5 on functions and others on collision detection, nearest acquaintances in high-dimensional areas, curve and floor reconstruction, embeddings of finite metric areas, polygonal linkages, the discrepancy procedure, and geometric graph theory
  • Thorough revisions of all last chapters
  • Extended assurance of computational geometry software program, now comprising chapters: one at the LEDA and CGAL libraries, the opposite on extra software
  • Two indices: An Index of outlined phrases and an Index of mentioned Authors
  • Greatly multiplied bibliographies

Show description

Read or Download Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications) PDF

Best Combinatorics books

Bent Functions: Results and Applications to Cryptography

Bent features: effects and purposes to Cryptography bargains a different survey of the items of discrete arithmetic often called Boolean bent capabilities. As those maximal, nonlinear Boolean services and their generalizations have many theoretical and sensible functions in combinatorics, coding idea, and cryptography, the textual content offers an in depth survey in their major effects, offering a scientific evaluate in their generalizations and functions, and contemplating open difficulties in class and systematization of bent services.

A First Course in Combinatorial Mathematics (Oxford Applied Mathematics and Computing Science Series)

Now in a brand new moment version, this quantity offers a transparent and concise remedy of an more and more very important department of arithmetic. a special introductory survey entire with easy-to-understand examples and pattern difficulties, this article comprises details on such uncomplicated combinatorial instruments as recurrence family members, producing capabilities, occurrence matrices, and the non-exclusion precept.

Winning Solutions (Problem Books in Mathematics)

This publication offers the mathematical instruments and problem-solving adventure had to effectively compete in high-level challenge fixing competitions. every one part offers vital history details after which offers numerous labored examples and routines to assist bridge the distance among what the reader may perhaps already understand and what's required for high-level competitions.

Combinatorial Designs: A Tribute to Haim Hanani (Annals of Discrete Mathematics)

Haim Hanani pioneered the options for developing designs and the idea of pairwise balanced designs, top on to Wilson's life Theorem. He additionally led the best way within the research of resolvable designs, masking and packing difficulties, latin squares, 3-designs and different combinatorial configurations.

Additional resources for Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications)

Show sample text content

Rated 4.94 of 5 – based on 24 votes