Discrete and computational geometry / Satyan L. Devadoss and Joseph O'Rourke.
Material type:
TextPublication details: Princeton, N.J. : Princeton University Press, ©2011.Description: xi, 255 paginas. : ilustraciones, (algunas a color) ; 27 x 18 centímetrosContent type: - texto
- sin medio
- volumen
- 9780691145532 (hardcover : alk. paper)
- 0691145539 (hardcover : alk. paper)
- QA 448 .D38 D48 2011
| Item type | Current library | Home library | Collection | Call number | Copy number | Status | Notes | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|---|---|---|
Libros para consulta en sala
|
Biblioteca Antonio Enriquez Savignac | Biblioteca Antonio Enriquez Savignac | COLECCIÓN RESERVA | QA 448 .D38 D48 2011 (Browse shelf(Opens below)) | 1 | No para préstamo (Préstamo interno) | Ingeniería Telemática | 038241 |
" * An online solutions manual is available (for teachers only). To obtain access, please e-mail: Vickie_Kearn@press.princeton.edu."
Incluye: referencias bibliográficas e índice.
""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."--P. Web Editorial
PIT
NUEVOSTELEMAT
