US$54.95 con 35 porcentaje de ahorro
Precio recomendado: US$85.00
El Precio listado es el precio de venta sugerido de un nuevo producto tal como lo proporciona un fabricante, proveedor o vendedor. Excepto para los libros, Amazon mostrará un Precio listado si los clientes compraron el producto en Amazon o si otros minoristas lo ofrecieron al Precio listado o a un precio superior al menos en los últimos 90 días. Los precios listados pueden no reflejar necesariamente el precio de mercado actual del producto.
Más información
Devoluciones internacionales gratis
US$10.06 de cargos de envío e importación a Canadá Detalles

Detalles de envío y tarifa

Precio US$54.95
Envío de AmazonGlobal US$7.18
Cargos estimados de importación US$2.88
Total US$65.01

Entrega entre el 4 - 7 de octubre
US$US$54.95 () Incluye las opciones seleccionadas. Incluye el pago mensual inicial y las opciones seleccionadas. Detalles
Precio
Subtotal
US$US$54.95
Subtotal
Desglose inicial del pago
Se muestran los gastos de envío, la fecha de entrega y el total del pedido (impuestos incluidos) al finalizar la compra
Enviado por
Amazon.com
Enviado por
Amazon.com
Vendido por
Amazon.com
Vendido por
Amazon.com
Devoluciones
Reintegro o reemplazo en 30 días
Reintegro o reemplazo en 30 días
Este artículo se puede devolver en su estado original para obtener un reintegro o reemplazo completo dentro de los 30 días posteriores a la recepción.
Devoluciones
Reintegro o reemplazo en 30 días
Este artículo se puede devolver en su estado original para obtener un reintegro o reemplazo completo dentro de los 30 días posteriores a la recepción.
Pago
Transacción segura
Tu transacción es segura
En Amazon, nos esforzamos por proteger tu seguridad y privacidad. Nuestro sistema de seguridad de pagos encripta tu información durante la transmisión de datos. No compartimos los datos de tu tarjeta de crédito con vendedores externos, ni vendemos tu información a terceros. Más información
Pago
Transacción segura
En Amazon, nos esforzamos por proteger tu seguridad y privacidad. Nuestro sistema de seguridad de pagos encripta tu información durante la transmisión de datos. No compartimos los datos de tu tarjeta de crédito con vendedores externos, ni vendemos tu información a terceros. Más información
Agregado a

Lo sentimos; hubo un problema.

Hubo un error al recuperar tus Listas de Deseos. Por favor inténtalo de nuevo.

Lo sentimos; hubo un problema.

Lista no disponible.
Imagen del logotipo de la aplicación Kindle

Descarga la app de Kindle gratis y comienza a leer libros Kindle al instante desde tu smartphone, tablet o computadora, sin necesidad de ningún dispositivo Kindle.

Lee al instante desde tu navegador con Kindle para la web.

Usando la cámara de tu celular escanea el siguiente código y descarga la aplicación Kindle.

Código QR para descargar la App Kindle

Sigue a los autores

Ocurrió un error. Intenta realizar tu solicitud de nuevo más tarde.

Discrete and Computational Geometry

4.5 4.5 de 5 estrellas 19 calificaciones

{"desktop_buybox_group_1":[{"displayPrice":"US$54.95","priceAmount":54.95,"currencySymbol":"US$","integerValue":"54","decimalSeparator":".","fractionalValue":"95","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"IYa4CCVFwSIljb1EuQPwwY3B3fWl3A7tHRv1t0TuVAlgKqRT35rzgBADk3%2Fp2L95qd0Xo%2FabusKb8A1kJdS5ZaTebN5BLYkQ6BoqSdiugzrACY7v1vTuGnCATkbyPVbW%2BW%2FFfgCQRcZpYxaD8JRkGw%3D%3D","locale":"es-US","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}]}

Opciones de compra y productos Add-on

An essential introduction to discrete and computational geometry

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 Poincaré 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)

Comprados juntos habitualmente

Este producto: Discrete and Computational Geometry
US$54.95
Vendido y enviado por Amazon.com.
+
+
US$50.50
Recíbelo el miércoles, 2 de octubre
Solo queda(n) 2 en stock (hay más unidades en camino).
Vendido por ayvax y enviado desde un centro de logística de Amazon.
Precio total: $00
Para consultar nuestro precio, agrega estos elementos a tu carrito
Detalles
Agregado al carrito
spCSRF_Treatment
Algunos de estos productos se envian antes que los otros.
Elige artículos para comprar juntos.

Opiniones editoriales

Críticas

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

Críticas

"This book is ideal for people who want to learn about the topic without wading too deeply into technical details. I really like the figures, and the writing style is very nice for students, with frequent jumps into exercises. The book favors topics that are intuitive, engaging, and easily grasped. It could form the basis of an excellent undergraduate-level course for students in computer science, applied mathematics, and pure mathematics."—Samir Khuller, University of Maryland

"I thoroughly enjoyed reading this book. It covers an incredibly diverse set of topics, ranging from elementary objects to deep mathematical concepts and important computational problems. Devadoss and O'Rourke have done a remarkable job of showing off the rich interplay between pure mathematics and computing that drives our research community. There really is nothing else like this on the market."
—Jeff Erickson, University of Illinois, Urbana-Champaign

Detalles del producto

  • Editorial ‏ : ‎ Princeton University Press (1 Mayo 2011)
  • Idioma ‏ : ‎ Inglés
  • Tapa dura ‏ : ‎ 272 páginas
  • ISBN-10 ‏ : ‎ 0691145539
  • ISBN-13 ‏ : ‎ 978-0691145532
  • Dimensiones ‏ : ‎ 7 x 0.75 x 10 pulgadas
  • Opiniones de clientes:
    4.5 4.5 de 5 estrellas 19 calificaciones

Sobre los autores

Sigue a los autores para recibir notificaciones de sus nuevas obras, así como recomendaciones mejoradas.

Opiniones de clientes

4.5 de 5 estrellas
19 calificaciones globales

Opiniones destacadas de los Estados Unidos

Calificado en Estados Unidos el 28 de febrero de 2018
Devadoss & O’Rourke serves as a great introduction to Computational Geometry. Understanding algorithmic themes and computational approaches to geometric problems constitute the book’s central focus. Some high-level pseudocode is given for important algorithms.

Good proofs are given, which are crucial, but it is the quality of visualizations that pushes this text into the “great” category for undergraduates.

This text is most properly classified as an undergraduate resource since the pseudocode isn’t overly precise (compare with de Berg, et al or O’Rourke’s Computational Geometry in C), data structures aren’t discussed at an advanced level, and the text assumes little-to-no formal algorithms background. One might argue that such omissions are a benefit to the text, for those who are only seeing Computational Geometry for the first time and/or do not have an advanced background with regards to correctness, running-time, etc. proofs need not get weighed down with too much detail. Alas, such detail is imperative for one to truly understand Computational Geometry, but perhaps one might follow this text with de Berg et al, or another graduate text.
Calificado en Estados Unidos el 3 de febrero de 2018
Exceptional book on this topic. Wonderful diagrams and illustrations.
Calificado en Estados Unidos el 4 de agosto de 2012
I really liked the first five chapters of this book. There's no code, or even pseudo code, but I found the algorithm descriptions to be very clear and give an intuitive understanding of how the algorithms work. It doesn't go into too much detail, but the Big-o running time is given for most of the algorithms. I felt that with a bit of work I would be able to implement most of the algorithms.

The last two chapters didn't seem to fit with the first five. They were very abstract, didn't mention running time analysis, and just didn't seem as practically useful as the first part of the book. The explanations in these chapters also weren't as clear, and I doubt I'd be able to implement any of it without another reference.

The later parts of the book also use a lot of more advanced topics without much explanation. There are several sections starting off like "______ is an advanced topic we can't begin to explain here, but ..." and then going on to use some advanced result or theory.

On a positive note, the Kindle version is typeset very well, and even uses color. I read in the browser, on my kindle, and in the iPad kindle reader, and it looked excellent in all three, which is not always the case for technical books with equations and figures.
A 12 personas les resultó útil
Reportar
Calificado en Estados Unidos el 9 de julio de 2016
It has long been universally recognized that one field of mathematics in which unsolved problems can be understood by 12-year-olds even though actually solving them will require rare genius, broad erudition, and hard work, is number theory.

It seems less widely recognized that another such field is discrete geometry.

This is a textbook on discrete geometry. requiring very modest prerequisite material.

Along the way it presents numerous math problems that no one has ever solved, and students with almost no technical background will understand the questions. Perhaps some of them will become the first to solve some of those problems.

The technical background needed to understand this book is very modest, maybe not more than a bit of high-school algebra. Nonetheless, the student will have to work hard.

Two occasions in mathematics where vector spaces over the field of rational numbers are used are proofs of the Buckingham pi theorem of physics (not in this book) and Max Dehn's solution of Hilbert's third problem, which is about dissections of polytopes. Dehn's solution appears in this book.

UNSOLVED PROBLEM 1: Which polyhedra can be partitioned into disjoint tetrahedra?

(Each unsolved problem is labeled "UNSOLVED PROBLEM" in capital letters.)

UNSOLVED PROBLEM 2: For which classes of polygons does the number of triangulations have a closed form?

UNSOLVED PROBLEM 3: Find the smallest triangulation of the n-dimensional cube into n-simplices.

UNSOLVED PROBLEM 6: Can a polygon whose edges are mirrors be covered by only one guard?

UNSOLVED PROBLEM 11: Is there a polynomial-time algorithm for counting the triangulations of a set of points in the plane?

UNSOLVED PROBLEM 12: Is there a polynomial-time algorithm for finding the distance between the nodes of a flip graph?

UNSOLVED PROBLEM 13: Is the flip graph of every point set in 3-space connected?

UNSOLVED PROBLEM 23: Show that flexing a flexible polyhedron does not change its Dehn invariant.

UNSOLVED PROBLEM 29 is the celebrated P = NP problem.
Calificado en Estados Unidos el 31 de enero de 2021
Discrete and Computatuional Geometry by Satyan L. Devadoss and Joseph O'Rourke is the best books in Mathematics that I have read in at at least a decade, and I have read quite a few few!

The book is clearly written with great examples. In addition, the authors state what problems are currently unproven in the field and would make great Ph. D. topics, and might even lead to to a Fields Medal, or more, if solved.

This book can be read and understood by anyone with a knowledge of basic geometry. The format of the book makes the subject palatable to even the those without a background in Mathematics.

Furthermore, the authors provide references to other more in depth texts, some of which I have read. However, this book is much better than those texts as far as understanding the subject area. I would consider this book a model for anyone writing a textbook.