Buy Used
$21.00
+ $3.99 shipping
Used: Very Good | Details
Sold by -usedbooks123-
Condition: :
Comment: Very Good Some wear on book from reading, we guarantee all purchases
Access codes and supplements are not guaranteed with used items.
Sell yours for a Gift Card
We'll buy it for $2.00
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Handbook of Discrete and Computational Geometry Hardcover – July 15, 1997

ISBN-13: 978-0849385247 ISBN-10: 0849385245 Edition: 1st

Used
Price: $21.00
6 New from $121.08 16 Used from $21.00
Amazon Price New from Used from
Hardcover
"Please retry"
$121.08 $21.00
Paperback
"Please retry"

Best Books of the Year
See the Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.
NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Series: Discrete and Combinatorial Mathematics Series
  • 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,931,214 in Books (See Top 100 in Books)

Customer Reviews

4.0 out of 5 stars
5 star
0
4 star
1
3 star
0
2 star
0
1 star
0
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

14 of 14 people found the following review helpful 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 Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again