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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Jacob Goodman, Richard Pollack and János Pach are each distinguished professors and authors in their own right, and together they are the pre-eminent founders and editors-in-chief of the journal, Discrete & Computational Geometry. Over the 20 years since the founding of this premiere journal, it has become synonymous with the field of discrete and computational geometry itself.
This commemorative book contains the 28 major articles that appeared in the 2008 Twentieth Anniversary Issue of the journal Discrete & Computational Geometry, and presents a comprehensive picture of the current state of the field. Formed during the past few decades by the merger of the classical discipline of combinatorial and discrete geometry with the new field of computational geometry that sprang up in the 1970s, discrete and computational geometry now claims the allegiance of a sizeable number of mathematicians and computer scientists all over the world, whose most important work has been appearing since 1986 in the pages of the journal.
The articles in this volume, a number of which solve long-outstanding problems in the field, were chosen by the editors of DCG for the importance of their results, for the breadth of their scope, and to show the intimate connections that have arisen between discrete and computational geometry and other areas of both computer science and mathematics. Apart from the articles, the editors present an expanded preface, along with a set of photographs of groups and individuals who have played a major role in the history of the field during the past twenty years.
Contributors include:
E. Ackerman
P.K. Agarwal
I. Aliev
I. Bárány
A. Barvinok
S. Basu
L.J. Billera
J.-D. Boissonnat
C. Borcea
E. Boros
K. Borys
B. Braun
K. Buchin
O. Cheong
D. Cohen-Steiner
M. Damian
K. Elbassioni
R. Flatland
T. Gerken
J.E. Goodman
X. Goaoc
P. Gronchi
V. Gurvich
S. Har-Peled
J. Hershberger
A. Holmsen
S.K. Hsiao
A. Hubard
J. Jerónimo
L. Khachiyan
R. Klein
C. Knauer
S. Langerman
J.-Y. Lee
M. Longinetti
E. Miller
P. Morin
U.Nagel
E. Nevo
P. Niyogi
I. Novik
J. O'Rourke
J. Pach
I. Pak
M.J. Pelsmajer
S. Petitjean
F. Pfender
R. Pinchasi
R. Pollack
J.S. Provan
K. Przeslawski
R.M. Richardson
G. Rote
M. Schaefer
Y. Schreiber
M. Sharir
J.R. Shewchuk
S. Smale
B. Solomyak
M. Soss
D. Stefankovic
G. Vegter
V.H. Vu
S. Weinberger
L. Wu
D. Yost
H. Yu
T. Zell
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 10,17 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: 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. Artikel-Nr. 7442348
Anzahl: 4 verfügbar
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. Artikel-Nr. ABNR-72457
Anzahl: 5 verfügbar
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. Artikel-Nr. ABNR-512
Anzahl: 5 verfügbar
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. Artikel-Nr. ABNR-93165
Anzahl: 1 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 656 pp. Englisch. Artikel-Nr. 9780387873626
Anzahl: 2 verfügbar
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. Artikel-Nr. 9780387873626
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780387873626_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 20 anv edition. 635 pages. 9.50x6.25x1.25 inches. In Stock. Artikel-Nr. x-0387873627
Anzahl: 2 verfügbar