Discrete computational geometry par devadoss satyan (47 résultats)

hardcover. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Etat : Very Good. Book in Very Good condition.

Hardcover. Etat : Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Hardcover. Etat : Very Good. This is a new book that has some damage, which is usually a tear, a scratch, dents or stain on the edge, pages are clean, no missing pages.

Hardcover. Etat : Very Good. This is a new book that has some minor damage, which is usually a tear, a scratch, dents or stain on the edge, pages are clean, no missing pages.

Hardcover. Etat : Very Good. This is a new book that has some minor damage, which is usually a tear, a scratch, dents or stain on the edge, pages are clean, no missing pages.

Etat : New.

hardcover. Etat : Very Good. 2nd edition. Hardcover issued without dust-jacket. Clean and solid. Ships from a smoke-free home.

Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1100grams, ISBN:9780691145532.

Etat : New.

Etat : As New. Unread book in perfect condition.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : New.

Etat : New.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : As New. Unread book in perfect condition.

Etat : new.

Etat : New. 2011. Hardcover. Offers a comprehensive introduction to discrete geometry. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as subjects like pseudotriangulations, curve reconstruction, and locked chains. It is suitable for sophomores in mathematics, computer science, engineering, or physics. Num Pages: 280 pages, 182 color illus. 4 line illus. 7 tables. BIC Classification: PBM; PBW; UYAM. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 257 x 184 x 22. Weight in Grams: 996. . . . . .…

Etat : new.

hardcover. Etat : New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Hardback. Etat : New. The essential introduction to discrete and computational geometry-now fully updated and expandedDiscrete and Computational Geometry bridges the theoretical world of discrete geometry with the applications-driven realm of computational geometry, offering a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. Beginning with polygons and ending with polyhedra, it explains how to capture the shape of data given by a set of points, from convex hulls and triangulations to Voronoi diagrams, geometric duality, chains, linkages, and alpha complexes. Connections to real-world applications are made throughout, and algorithms are presented independent of any programming language. Now fully updated and expanded, this richly illustrated textbook is an invaluable learning tool for students in mathematics, computer science, engineering, and physics.Now with new sections on duality and on computational topologyProject suggestions at the end of every chapterCovers traditional topics as well as new and advanced materialFeatures numerous full-color illustrations, exercises, and fully updated unsolved problemsUniquely designed for a one-semester classAccessible to college sophomores with minimal backgroundAlso suitable for more advanced studentsOnline solutions manual (available to instructors).…

Etat : New.

Etat : New.

Hardcover. Etat : new. Hardcover. The essential introduction to discrete and computational geometrynow fully updated and expandedDiscrete and Computational Geometry bridges the theoretical world of discrete geometry with the applications-driven realm of computational geometry, offering a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. Beginning with polygons and ending with polyhedra, it explains how to capture the shape of data given by a set of points, from convex hulls and triangulations to Voronoi diagrams, geometric duality, chains, linkages, and alpha complexes. Connections to real-world applications are made throughout, and algorithms are presented independent of any programming language. Now fully updated and expanded, this richly illustrated textbook is an invaluable learning tool for students in mathematics, computer science, engineering, and physics.Now with new sections on duality and on computational topologyProject suggestions at the end of every chapterCovers traditional topics as well as new and advanced materialFeatures numerous full-color illustrations, exercises, and fully updated unsolved problemsUniquely designed for a one-semester classAccessible to college sophomores with minimal backgroundAlso suitable for more advanced studentsOnline solutions manual (available to instructors) "A new edition of the first undergraduate-level textbook to bridge the gap between discrete math and computational geometry"-- Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Hardback. Etat : New. The essential introduction to discrete and computational geometry-now fully updated and expandedDiscrete and Computational Geometry bridges the theoretical world of discrete geometry with the applications-driven realm of computational geometry, offering a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. Beginning with polygons and ending with polyhedra, it explains how to capture the shape of data given by a set of points, from convex hulls and triangulations to Voronoi diagrams, geometric duality, chains, linkages, and alpha complexes. Connections to real-world applications are made throughout, and algorithms are presented independent of any programming language. Now fully updated and expanded, this richly illustrated textbook is an invaluable learning tool for students in mathematics, computer science, engineering, and physics.Now with new sections on duality and on computational topologyProject suggestions at the end of every chapterCovers traditional topics as well as new and advanced materialFeatures numerous full-color illustrations, exercises, and fully updated unsolved problemsUniquely designed for a one-semester classAccessible to college sophomores with minimal backgroundAlso suitable for more advanced studentsOnline solutions manual (available to instructors).…

Etat : As New. Unread book in perfect condition.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : New. pp. xi + 255 186 Illus.