Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Handbook of Discrete and Computational Geometry 1st Edition

4.0 out of 5 stars 1 customer review
ISBN-13: 978-0849385247
ISBN-10: 0849385245
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used
$3.86
Condition: Used - Good
In Stock. Sold by Free State Books
Condition: Used: Good
Comment: Ex-Library Book - will contain Library Markings. Book shows minor use. Cover and Binding have minimal wear, and the pages have only minimal creases. Free State Books. Never settle for less.
Access codes and supplements are not guaranteed with used items.
15 Used from $3.86
+ $3.99 shipping
More Buying Choices
12 New from $91.26 15 Used from $3.86

Windows10ForDummiesVideo
Windows 10 For Dummies Video Training
Get up to speed with Windows 10 with this video training course from For Dummies. Learn more.
click to open popover
NO_CONTENT_IN_FEATURE

The latest book club pick from Oprah
"The Underground Railroad" by Colson Whitehead is a magnificent novel chronicling a young slave's adventures as she makes a desperate bid for freedom in the antebellum South. See more

Product Details

  • Series: Discrete Mathematics and Its Applications
  • Hardcover: 1008 pages
  • Publisher: CRC Press; 1 edition (July 15, 1997)
  • Language: English
  • ISBN-10: 0849385245
  • ISBN-13: 978-0849385247
  • Product Dimensions: 2 x 7.5 x 10.5 inches
  • Shipping Weight: 4.2 pounds
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #3,940,799 in Books (See Top 100 in Books)

Customer Reviews

5 star
0%
4 star
100%
3 star
0%
2 star
0%
1 star
0%
See the customer review
Share your thoughts with other customers

Top Customer Reviews

By Dr. Lee D. Carlson HALL OF FAMEVINE VOICE on March 25, 2001
Format: Hardcover
This book, written by many well-known experts in the field, is a fine compendium of articles on the most active areas of computational geometry. Each article is supplemented with a glossary of terms needed for understanding the relevant concepts and frequently contains a list of open problems. An overview of the convex hull of a collection of random points in Euclidean n-space is given in one of the articles on discrete aspects of stochastic geometry, where also a very interesting discussion of generalizations of the Buffon needle problem is given.
There are a few articles overviewing Voronoi diagrams, such as the one on Voronoi diagrams and triangulations. The applications of Voronoi diagrams are many, and include tumour cell diagnosis, biometry, galaxy distributions, and pattern recognition. This article is a little short considering the importance of the subject.
The article on shortest paths and networks is somewhat disappointing since there is no in-depth discussion on network routing algorithms.
The article on computational topology highlights some of the results in this very important area. Many problems in topology have been tackled recently using computers, particularly the work of the mathematician A.T. Fomenko. Computational topology is a relatively young field, having been in existence only since the early 1990's. The applications are enormous, ranging from meshing, morphing, feature extraction, data compression, and in many scientific areas such as computational medicine, chemistry, and astrophysics. It can also be used in computer security via graphical passwords. It is an immense help in visualizing complicated topological objects, such as Lens spaces, horned spheres, and thickened knots.
Read more ›
Comment 14 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Pages with Related Products. See and discover other items: combinatorics, discrete