Isbn: 9780387873626 - twentieth anniversary volume: discrete & computational geometry: discrete & computational geometry (24 risultati)

Condizione: 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.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

Condizione: New. pp. 656.

Condizione: 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.

Condizione: 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.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: New. pp. 656.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

Condizione: 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.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Brand New. 20 anv edition. 635 pages. 9.50x6.25x1.25 inches. In Stock.

Paperback. Condizione: New Books. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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.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. 656 pp. Englisch.…

Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents a comprehensive picture of the current state of the field of discrete and computational geometryIncludes an expanded preface, with a set of photographs of groups and individuals who have played a major role in the history of the field in .…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 KG, Sachsenplatz 4-6, 1201 Wien 656 pp. Englisch.…

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt 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.…