
Discrete and Computational Geometry
Princeton University Press
Published on 1. May 2011
Book
Hardback
272 pages
978-0-691-14553-2 (ISBN)
Description
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
* 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
Reviews / Votes
"Discrete and Computational Geometry meets an urgent need for an undergraduate text bridging the theoretical sides and the applied sides of the field. It is an excellent choice as a textbook for an undergraduate course in discrete and computational geometry! The presented material should be accessible for most mathematics or computer science majors in their second or third year in college. The book also is a valuable resource for graduate students and researchers."--Egon Schulte, Zentralblatt MATH "[W]e recommend this book for an undergraduate course on computational geometry. In fact, we hope to use this book ourselves when we teach such a class."--Brittany Terese Fasy and David L. Millman, SigAct NewsMore details
Language
English
Place of publication
New Jersey
United States
Target group
College/higher education
Professional and scholarly
Product notice
Trade binding
Illustrations
182 color + 4 b/w illus. 7 tables.
Dimensions
Height: 266 mm
Width: 187 mm
Thickness: 24 mm
Weight
829 gr
ISBN-13
978-0-691-14553-2 (9780691145532)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Joseph O'Rourke | Satyan L. Devadoss
Discrete and Computational Geometry
E-Book
04/2011
1st Edition
Princeton University Press
€76.49
Available for download
Persons
Satyan L. Devadoss is associate professor of mathematics at Williams College. Joseph O'Rourke is the Olin Professor of Computer Science and professor of mathematics at Smith College. His books include "Geometric Folding Algorithms: Linkages, Origami, Polyhedra".