Algorithms in Combinatorial Geometry - Monographs in Theoretical Computer Science : an Eatcs Series - Herbert Edelsbrunner - Knihy - Springer-Verlag Berlin and Heidelberg Gm - 9783642648731 - 23. septembra 2011
V prípade, že obal a názov nesedia, platí názov

Herbert Edelsbrunner
Algorithms in Combinatorial Geometry - Monographs in Theoretical Computer Science : an Eatcs Series Softcover Reprint of the Original 1st Ed. 1987 edition

Cena
€ 89,49

Objednané zo vzdialeného skladu

Očakávané doručenie 19. - 27. nov
Vianočné darčeky je možné vrátiť do 31. januára
Dostávajte upozornenia na nové nahrávky interpreta Herbert Edelsbrunner

Naši zákazníci hovoria:

14-dňová lehota na vrátenie podľa európskej legislatívy o ochrane spotrebiteľa
Najvyššie hodnotenie na Trustpilot
Pridať do vášho zoznamu prianí na iMusic

Not rated yet

Tiež dostupné ako:

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa­ tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con­ structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com­ binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.

423 pages, biography

Médium Knihy     Paperback Book   (Kniha s mäkkou väzbou a lepeným chrbtom)
Vydané 23. septembra 2011
ISBN13 9783642648731
Vydavatelia Springer-Verlag Berlin and Heidelberg Gm
Strany 423
Rozmery 156 × 234 × 22 mm   ·   616 g
Jazyk Angličtina  

Viac od Herbert Edelsbrunner

Zobraziť všetko

Viac od toho istého vydavateľa

Pozrieť všetko od Herbert Edelsbrunner