Computational Geometry: Algorithms and Applications 3rd Edition by Mark de Berg (PDF)

6

 

Ebook Info

  • Published: 2008
  • Number of pages: 398 pages
  • Format: PDF
  • File Size: 3.43 MB
  • Authors: Mark de Berg

Description

This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐The book came in great condition. I think this book is printed on-demand, and it felt that my copy just came out of the printing. Very pleased.The content is great, I immediately found some techniques to solve the problems that I am working on at the moment.

⭐Comprehensive, deep, clear (i.e. readable). Pseudo-code (high level) is provided at end of each chapter. Also exercises. Reader must still convert from pseudo-code to programming language in order to actually implement. A web site is listed to help with that, which provides links to programming resources. I haven’t yet tried them..

⭐Beautiful book, solid contents. I learned a lot from it and had a nice time practicing with the exercises. Lots of examples and problems, a lot of interesting algorithms and techniques, every chapter is a progressive refinement of a particular idea to solve a problem expressed as geometry.Difficulty level: make sure you know some asymptotic analysis and discrete mathematics to get the best out of it, but could be read by anyone who can code i believe (although again, he’ll miss a lot of beautiful mathematics)Again, i’m very satisfied with it.

⭐This book is a must to all researchers and students of the field. The algorithms are always presented in the context of an application, which makes it the more understandable. However, the authors chose to present them in a very high level of abstraction, and some of the finer details – so important in these algorithms – are only mentioned, which may pose a problem to obtaining a suitable, efficient implementation of them in a programming language.

⭐It is a joy to read and review this book — the exposition is crystal clear; the writing style is warm and engaging (not too terse and not too verbose), conveying understanding and not just stating facts, theorems, and algorithms; the graphics are great (numerous richly detailed illustrations); the topics hit the heart of computational geometry; the historical remarks help set context; and the book is beautifully typeset and printed on high quality acid free paper.

⭐This is a computer science textbook for undergraduates. Lots of “real world” uses for computational geometry to egg-on the unmotivated. Not so good for those that ARE already motivated.The text glosses over basic tasks such as “whether a point lies to the left or right of a directed line” (page 4) with the expectation that some unnamed library function will do this. For me, not so. Moreover I’d would have liked to read a geometric proof of such things. The foundations are left out, yet elsewhere they waste space to give us Pythagoras’ Theorem.

⭐Great book, very insightful and the fact the book is so technical didn’t disable the book’s didactic, which by the way i thought very well of it!!!!

⭐I like this book. The shipment was fast as well. I have this project that requires constant use of algorithms presented in this book. It could be better if the well known voronoi delaunay triangulation parts were kept minimal, but this might be a little subjective comment.

⭐The book itself is good, I had already read previews and excerpts so I knew what I was getting.What I wasn’t expecting was that the Kindle version would have no bookmarks, no clickable table of contents etc. The only bookmark is for the front cover. So the only way to get to a chapter you want to read is to scroll until you find it – in a 388 page book. Very disappointed.

⭐In realtà questo testo non ha niente che non vada dal punto di vista della correttezza e del livello qualitativo dei contenuti. Opinabile, dal mio punto di vista, è lo stile scelto dagli autori nell’esposizione. Probabilmente è più adatto come secondo testo che come primo approccio alla materia. Tengo a sottolineare che sono riuscito a leggere solo i primi 3 capitoli poi non ce l’ho più fatta e sono passato ad un altro testo.Detto questo, il maggiore difetto che ho riscontrato, a mio modesto parere, è il continuo tentativo di spiegare, con irrefrenabile incontinenza verbale, quello che avrebbe potuto essere spiegato con una semplice frase ed una figura. Questo costringe il lettore a dover rileggere più volte ogni singola frase.Inoltre trovo confusionario il tentativo di spiegare (naturalmente anche qui senza figure) i dettagli ed i casi particolari degli algoritmi prima del relativo pseudocodice.Non che figure ed illustrazioni siano assenti. Ce ne sono parecchie ma il più delle volte fanno riferimento a casi banali che, si in quel caso, avrebbero potuto essere spiegati solo con una o due semplici frasi.Forse non l’ho approcciato nel migliore dei modi ma sta di fatto che dopo 3 capitoli di continue letture e riletture la voglia di scaraventarlo fuori dalla finestra era troppo forte e sono dovuto passare ad un altro testo (quello di O’Rourke per la precisione).The book has four authors. It is relatively rare that they collaborated exceptionally well and the topic is explored in a systematic way, covering the theoretical bases and with very practical examples introduced and then elaborate upon. I highly recommend this book to anybody with interest in Computational Geometry.Vlad WOJCIK, Retired professor of Computer Science

⭐Utilizzato durante un corso universitario.Tratta una vasta gamma di algoritmi in maniera semplice, facendo spesso uso di pseudo-codice.Consigliato se si desidera ottenere un’infarinatura teorica di problemi e algoritmi riguardanti la geometria computazionale: si spazia dai convex-hull sino ai range-trees, dalle triangolarizzazioni di Delaunay ai Quad-Trees e molto altro.Ho comprato il libro come supporto ad un corso universitario di geometria computazionale. Il libro ha un’interessante selezione di argomenti, che vengono introdotti con un problema reale per motivarne la trattazione. L’ho trovato nel complesso molto comprensibile e potenzialmente interessante anche da solo (senza un corso) per chi è interessato all’argomento.

Keywords

Free Download Computational Geometry: Algorithms and Applications 3rd Edition in PDF format
Computational Geometry: Algorithms and Applications 3rd Edition PDF Free Download
Download Computational Geometry: Algorithms and Applications 3rd Edition 2008 PDF Free
Computational Geometry: Algorithms and Applications 3rd Edition 2008 PDF Free Download
Download Computational Geometry: Algorithms and Applications 3rd Edition PDF
Free Download Ebook Computational Geometry: Algorithms and Applications 3rd Edition

Previous articleData Structures and Algorithms with Python (Undergraduate Topics in Computer Science) 2015th Edition by Kent D. Lee (PDF)
Next articleA Beginner’s Guide to Scala, Object Orientation and Functional Programming 2nd Edition by John Hunt (PDF)