Satyan L. Devadoss – författare
Visar alla böcker från författaren Satyan L. Devadoss. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
683 kr
Skickas inom 5-8 vardagar
Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincare conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems.* The essential introduction to discrete and computational geometry * Covers traditional topics as well as new and advanced material * Features numerous full-color illustrations, exercises, and unsolved problems * Suitable for sophomores in mathematics, computer science, engineering, or physics * Rigorous but accessible * An online solutions manual is available (for teachers only). To obtain access, please e-mail: Vickie_Kearn@press.princeton.edu
683 kr
Skickas inom 5-8 vardagar
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)