BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Computational Geometry : Algorithms and Applications

Computational Geometry : Algorithms and Applications

Computational Geometry : Algorithms and Applications Hardback - 2000

by Marc Van Kreveld; Mark Overmars; Otfried Schwarzkopf; Mark de Berg

Add to wish list
  • Used
  • very good
  • Hardback
Used - Very good

Description

Springer, 2000. Hardcover. Very Good. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.Dust jacket quality is not guaranteed.
Ask the seller a question Add to wish list
A$21.61
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from ThriftBooks (Washington, United States)

Details

About ThriftBooks Washington, United States

Biblio member since 2018

From the largest selection of used titles, we put quality, affordable books into the hands of readers

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from ThriftBooks

Reader reviews for Computational Geometry : Algorithms and Applications

From the publisher

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.

First line

Good solutions to algorithmic problems of geometric nature are mostly based on two ingredients.
tracking-