Imagen 1 de 1
Galería
Imagen 1 de 1
Discrete & Computational Geometry by Jacob E. Goodman SC 2009
USD22,00
Aproximadamente19,09 EUR
Estado:
Como nuevo
Libro en perfecto estado y poco leído. La tapa no tiene desperfectos y si procede, con sobrecubierta para las tapas duras. Incluye todas las páginas sin arrugas ni roturas. El texto no está subrayado ni resaltado de forma alguna, y no hay anotaciones en los márgenes. Puede presentar marcas de identificación mínimas en la contraportada o las guardas. Muy poco usado. Consulta el anuncio del vendedor para obtener más información y la descripción de cualquier posible imperfección.
- ¡Cómpralo ya!Discrete & Computational Geometry by Jacob E. Goodman SC 2009
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Recogida:
Recogida local gratis en Woburn, Massachusetts, Estados Unidos.
Envío:
USD4,40 (aprox. 3,82 EUR) USPS Media MailTM.
Ubicado en: Woburn, Massachusetts, Estados Unidos
Entrega:
Entrega prevista entre el vie. 27 jun. y el sáb. 5 jul.
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Pagos:
Compra con confianza
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:335364176639
Características del artículo
- Estado
- ISBN
- 9780387873626
Acerca de este producto
Product Identifiers
Publisher
Springer New York
ISBN-10
0387873627
ISBN-13
9780387873626
eBay Product ID (ePID)
71200407
Product Key Features
Number of Pages
Xviii, 635 Pages
Publication Name
Discrete and Computational Geometry
Language
English
Publication Year
2008
Subject
Geometry / Analytic, Geometry / General, Geometry / Algebraic, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics
Format
Trade Paperback
Dimensions
Item Weight
35 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Edition Number
20
Intended Audience
Scholarly & Professional
Dewey Edition
22
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
516.00285
Table Of Content
There Are Not Too Many Magic Configurations.- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles.- Robust Shape Fitting via Peeling and Grating Coresets.- Siegel's Lemma and Sum-Distinct Sets.- Slicing Convex Sets and Measures by a Hyperplane.- A Centrally Symmetric Version of the Cyclic Polytope.- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities.- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres.- Isotopic Implicit Surface Meshing.- Line Transversals to Disjoint Balls.- Norm Bounds for Ehrhart Polynomial Roots.- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.- Grid Vertex-Unfolding Orthogonal Polyhedra.- Empty Convex Hexagons in Planar Point Sets.- Affinely Regular Polygons as Extremals of Area Functionals.- Improved Output-Sensitive Snap Rounding.- Generating All Vertices of a Polyhedron Is Hard.- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property.- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.- Empty Simplices of Polytopes and Graded Betti Numbers.- Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes.- Finding the Homology of Submanifolds with High Confidence from Random Samples.- Odd Crossing Number and Crossing Number Are Not the Same.- Visibility Graphs of Point Sets in the Plane.- Decomposability of Polytopes.- An Inscribing Model for Random Polytopes.- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.- General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties.
Synopsis
While we were busy putting together the present collection of articles celebrating the twentieth birthday of our journal, Discrete & Computational Geometry, and, in a way, of the ?eld that has become known under the same name, two more years have elapsed. There is no doubt that DCG has crossed the line between childhood and adulthood. By the mid-1980s it became evident that the solution of many algorithmic qu- tions in the then newly emerging ?eld of computational geometry required classical methodsandresultsfromdiscreteandcombinatorialgeometry. Forinstance,visibility and ray shooting problems arising in computer graphics often reduce to Helly-type questions for line transversals; the complexity (hardness) of a variety of geometric algorithms depends on McMullen's upper bound theorem on convex polytopes or on the maximum number of "halving lines" determined by 2n points in the plane, that is, the number of different ways a set of points can be cut by a straight line into two parts of the same size; proximity questions stemming from several application areas turn out to be intimately related to Erdos' ? s classical questions on the distribution of distances determined by n points in the plane or in space. On the other hand, the algorithmic point of view has fertilized several ?elds of c- vexity and of discrete geometry which had lain fallow for some years, and has opened new research directions., This heavily-illustrated book contains twenty-eight major articles that present a comprehensive picture of the current state of discrete and computational geometry. Many of the articles solve long-outstanding problems in the field., While we were busy putting together the present collection of articles celebrating the twentieth birthday of our journal, Discrete & Computational Geometry, and, in a way, of the ?eld that has become known under the same name, two more years have elapsed. There is no doubt that DCG has crossed the line between childhood and adulthood. By the mid-1980s it became evident that the solution of many algorithmic qu- tions in the then newly emerging ?eld of computational geometry required classical methodsandresultsfromdiscreteandcombinatorialgeometry. Forinstance, visibility and ray shooting problems arising in computer graphics often reduce to Helly-type questions for line transversals; the complexity (hardness) of a variety of geometric algorithms depends on McMullen's upper bound theorem on convex polytopes or on the maximum number of "halving lines" determined by 2n points in the plane, that is, the number of different ways a set of points can be cut by a straight line into two parts of the same size; proximity questions stemming from several application areas turn out to be intimately related to Erdos' ? s classical questions on the distribution of distances determined by n points in the plane or in space. On the other hand, the algorithmic point of view has fertilized several ?elds of c- vexity and of discrete geometry which had lain fallow for some years, and has opened new research directions.
LC Classification Number
QA639.5-640.7
Descripción del artículo del vendedor
Acerca de este vendedor
Regroovablebooks
95,8% de votos positivos•93 mil artículos vendidos
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
Categorías populares de esta tienda
Votos de vendedor (45.981)
- 2***0 (126)- Votos emitidos por el comprador.Mes pasadoCompra verificadaShipping was quick, packaging was excellent, condition was acceptable as described -- binding loose but pages intact. I did message buyer asking about mold and didn't receive a reply -- luckily, there appears to be no mold. Great value for a 100+ yr old book!
- a***p (8)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaI received my book in absolutely pristine condition, better than described! Which is impressive because the copy is from 1930 and it looks like it has never been handled. It shipped very quickly, even faster than the estimated time given by a week. It was packaged very carefully. The book and shipping price was also very fair considering the age and condition of the book and the shipping speed. I am very pleased with this seller and will be ordering from them again in the future.
- 5***8 (18)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaI am always a little nervous when ordering books off of eBay but this seller has provided me with an EXCELLENT purchasing experience! The packaging was superior and I am grateful because this is a signed first edition and we all know how the post office can be at times. The Shipping was timely and the item actually arrived quicker than expected. The item EXCEEDED the description. It is stunning. I have dropped it off at my antiquarian for authors signature verification but the value is high.What Negro Wants by Rayford W Logan 1944 (HC/DJ) (#335500668720)
Más que explorar:
- Libros infantiles y juveniles 2000 - 2009,
- Libros de literatura infantil y juvenil 2000 - 2009,
- Libros de texto 2000 - 2009,
- Libros de literatura y narrativa novelas 2000 - 2009,
- Libros prácticos y de consulta 2000 - 2009,
- Libros de texto, año de publicación 2000 - 2009, en inglés,
- Libros de texto, educación y referencia 2000 - 2009,
- Libros infantiles y juveniles, año de publicación 2000 - 2009, en inglés,
- Libros de literatura y narrativa, año de publicación 2000 - 2009, en español,
- Libros prácticos y de consulta, año de publicación 2000 - 2009, libros