Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
EUR 39,27
Anzahl: 4 verfügbar
In den WarenkorbZustand: New. pp. 656 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 115,14
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Twentieth Anniversary Volume: Discrete & Computational Geometry | Jacob E. Goodman (u. a.) | Taschenbuch | xviii | Englisch | 2008 | Springer | EAN 9780387873626 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Sprache: Englisch
Verlag: Springer-Verlag New York Inc., 2008
ISBN 10: 0387873627 ISBN 13: 9780387873626
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 157,35
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 20 anv edition. 635 pages. 9.50x6.25x1.25 inches. In Stock.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.