Algorithms in Combinatorial Geometry - Monographs in Theoretical Computer Science : an Eatcs Series - Herbert Edelsbrunner - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783642648731 - 2011. gada 23. septembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Cena
€ 90,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 3. - 11. aug.
Saņemiet paziņojumus par jauniem Herbert Edelsbrunner izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

Pieejams arī kā:

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2011. gada 23. septembris
ISBN13 9783642648731
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 423
Izmēri 156 × 234 × 22 mm   ·   616 g
Valoda Angļu  

Vairāk no Herbert Edelsbrunner

Rādīt visu

Vairāk no tā paša izdevēja

Skatīt visus Herbert Edelsbrunner ( piem., Paperback Book un Hardcover Book )