Computational Geometry
Algorithms and Applications
Second, Revised Edition.
Our rough guess is there are 91,750 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 7 minutes to read. With a half hour per day, this will take 12 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Kreveld, Marc - Contributor
- Overmars, Mark - Contributor
- Schwarzkopf, Otfried Cheong - Contributor
Publication
2000 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
91,750 words, Guess
Page Count
367 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivecomputationalgeo00berg_884
- ISBN-103662042479
- ISBN-103662042452
- ISBN-139783662042472
- ISBN-139783662042458
and 3 more
- OCLC Control Number851381989
- Better World Books9783662042458
- Open LibraryOL27025769M
Classifications
- DDC004.0151
- LCCQA76.9.M35
- LCCQA75.5-76.95
Description
This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will be especially welcome. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement. All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered. The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms. In the second edition, besides revisions to the first edition, a number of new exercises have been added.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!