Discrete and computational geometry / Satyan L. Devadoss and Joseph O'Rourke.
Tipo de material:
TextoDetalles de publicación: Princeton, N.J. : Princeton University Press, ©2011.Descripción: xi, 255 paginas. : ilustraciones, (algunas a color) ; 27 x 18 centímetrosTipo de contenido: - texto
- sin medio
- volumen
- 9780691145532 (hardcover : alk. paper)
- 0691145539 (hardcover : alk. paper)
- QA 448 .D38 D48 2011
| Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Signatura topográfica | Copia número | Estado | Notas | Fecha de vencimiento | Código de barras | Reserva de ítems | |
|---|---|---|---|---|---|---|---|---|---|---|---|
Libros para consulta en sala
|
Biblioteca Antonio Enriquez Savignac | Biblioteca Antonio Enriquez Savignac | COLECCIÓN RESERVA | QA 448 .D38 D48 2011 (Navegar estantería(Abre debajo)) | 1 | No para préstamo (Préstamo interno) | Ingeniería Telemática | 038241 |
Navegando Biblioteca Antonio Enriquez Savignac estanterías, Colección: COLECCIÓN RESERVA Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
| QA 447 S551 2011 Geometría sagrada : descifrando el código / | QA 448 D38 C31 Geogebra : mucho más que geometría dinámica / | QA 448 .D38 C65 2008 Computational geometry : algorithms and applications / | QA 448 .D38 D48 2011 Discrete and computational geometry / | QA 531 L69 2006 Trigonometría / | QA 551 G36 2009 Geometría analítica / | QA551 L456 Geometría analítica / |
" * 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
