Bild 1 von 1
Galerie
Bild 1 von 1
Diskrete & Rechengeometri
US $22,00
Ca.CHF 17,99
Artikelzustand:
Neuwertig
Buch, das wie neu aussieht, aber bereits gelesen wurde. Der Einband weist keine sichtbaren Gebrauchsspuren auf. Bei gebundenen Büchern ist der Schutzumschlag vorhanden (sofern zutreffend). Alle Seiten sind vollständig vorhanden, es gibt keine zerknitterten oder eingerissenen Seiten und im Text oder im Randbereich wurden keine Unterstreichungen, Markierungen oder Notizen vorgenommen. Der Inneneinband kann minimale Gebrauchsspuren aufweisen. Minimale Gebrauchsspuren. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers.
- Sofort-KaufenDiskrete & Rechengeometrie von Jacob E. Goodman SC 2009
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Abholung:
Kostenlose Abholung in Woburn, Massachusetts, USA.
Versand:
US $4,40 (ca. CHF 3,60) USPS Media MailTM.
Standort: Woburn, Massachusetts, USA
Lieferung:
Lieferung zwischen Fr, 27. Jun und Sa, 5. Jul nach 94104 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:335364176639
Artikelmerkmale
- Artikelzustand
- ISBN
- 9780387873626
Über dieses Produkt
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
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
Regroovablebooks
95,8% positive Bewertungen•93 Tsd. Artikel verkauft
Angemeldet als privater VerkäuferDaher finden verbraucherschützende Vorschriften, die sich aus dem EU-Verbraucherrecht ergeben, keine Anwendung. Der eBay-Käuferschutz gilt dennoch für die meisten Käufe.
Beliebte Kategorien in diesem Shop
Verkäuferbewertungen (45'981)
- _***h (90)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood seller A+
- 3***l (2877)- Bewertung vom Käufer.Letzter MonatBestätigter KaufPurchased and paid through buy it now. Days later received refund with no explanation! Horrible seller! Was looking forward to my purchase as it was a gift for my son!
- a***r (677)- Bewertung vom Käufer.Letzter MonatBestätigter Kaufexcellent
Noch mehr entdecken:
- Anna Jacobs Belletristik-Bücher,
- Jacob Grimm Belletristik-Bücher,
- Hörbücher und Hörspiele Jacob Grimm,
- Jacob-Grimm-Märchen-Belletristik - Bücher,
- Deutsche Jacob Grimm Hörbücher und Hörspiele,
- Anna Jacobs Belletristik-Bücher im Taschenbuch-Format,
- Deutsche Bücher Robert-E. - Howard-Belletristik,
- Hörbücher und Hörspiele Robert-E. - Howard,
- Robert-E. - Howard-Taschenbuch-Fantasy-Belletristik - Bücher,
- Robert-E. - Howard-Gebundene-Ausgabe-Belletristik - Bücher