Discrete and Computational Geometry

Regular price €82.99
Regular price €83.99 Sale Sale price €82.99
A01=Joseph O'Rourke
A01=Satyan L. Devadoss
Addition
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Associahedron
Author_Joseph O'Rourke
Author_Satyan L. Devadoss
automatic-update
Big O notation
Bijection
Bisection
Category1=Non-Fiction
Category=PBM
Category=PBW
Category=UYAM
Circumscribed circle
Collinearity
Computation
Computational geometry
Computer science
Configuration space
Conjecture
Convex hull
Convex polygon
Convex set
COP=United States
Cut locus (Riemannian manifold)
Degeneracy (mathematics)
Delaunay triangulation
Delivery_Delivery within 10-20 working days
Diagonal
Diagram (category theory)
Diameter
Dimension
Discrete geometry
Discrete mathematics
Dual graph
eq_computing
eq_isMigrated=2
eq_non-fiction
Equation
Euler's formula
Exterior (topology)
Formal proof
General position
Geometry
Graham scan
Heptagon
Homeomorphism
Inequality (mathematics)
Intersection (set theory)
Jordan curve theorem
Language_English
Line segment
Mathematical induction
Mathematician
Mathematics
Medial axis
Motion planning
Notation
NP-completeness
NP-hardness
PA=Available
Parity (mathematics)
Planar graph
Polygonal chain
Polyhedron
Polytope
Price_€50 to €100
PS=Active
Quadrilateral
Rectangle
Regular polygon
Right angle
Scientific notation
Simple polygon
softlaunch
Special case
Subset
Summation
Tangent space
Tetrahedron
Theorem
Three-dimensional space (mathematics)
Time complexity
Topology
Two-dimensional space
Upper and lower bounds
Voronoi diagram

Product details

  • ISBN 9780691145532
  • Weight: 992g
  • Dimensions: 178 x 254mm
  • Publication Date: 01 May 2011
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days: On Backorder

Will Deliver When Available: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

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