Discrete and Computational Geometry, 2nd Edition

Auteur
Satyan L. Devadoss is the Fletcher Jones Professor of Applied Mathematics and Professor of Computer Science at the University of San Diego. He is the author (with Matthew Harvey) of Mage Merlin’s Unsolved Mathematical Mysteries. Joseph O’Rourke is the Olin Professor of Computer Science and Professor of Mathematics (Emeritus) at Smith College. His books include How to Fold It: The Mathematics of Linkages, Origami, and Polyhedra.

Texte du rabat

"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)"--

Résumé

The essential introduction to discrete and computational geometry—now fully updated and expanded

Discrete 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 topology
• Project suggestions at the end of every chapter
• Covers traditional topics as well as new and advanced material
• Features numerous full-color illustrations, exercises, and fully updated unsolved problems
• Uniquely designed for a one-semester class
• Accessible to college sophomores with minimal background
• Also suitable for more advanced students
• Online solutions manual (available to instructors)