Computational Geometry in C
Series: Cambridge Tracts in Theoretical Computer Science;
- Publisher's listprice GBP 50.00
-
25 305 Ft (24 100 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 5 061 Ft off)
- Discounted price 20 244 Ft (19 280 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
25 305 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2, Revised
- Publisher Cambridge University Press
- Date of Publication 13 October 1998
- ISBN 9780521649766
- Binding Paperback
- No. of pages392 pages
- Size 254x178x20 mm
- Weight 680 g
- Language English
- Illustrations 259 b/w illus. 270 exercises 0
Categories
Short description:
This 1998 book explains the design of geometry algorithms, including discussion of implementation issues and working C code.
MoreLong description:
This is the revised and expanded 1998 edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. The code in this edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
'... the author does an excellent job of explaining difficult concepts in an accessible, even entertaining, manner ... If this is your field, this is your book!' Developers Review
Table of Contents:
1. Polygon triangulation; 2. Polygon partitioning; 3. Convex hulls in two dimensions; 4. Convex hulls in three dimensions; 5. Voronoi diagrams; 6. Arrangements; 7. Search and intersection; 8. Motion planning; 9. Sources.
More
