Kniha Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons Leonidas J Guibas

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons

Jazyk: Angličtina
Vazba: Pevná
Vydavatel: Palala Press
Dostupnost: Skladem u dodavatele
Odesíláme za 9-15 dnů
664
This work has been selected by scholars as being culturally important, and is part of the knowledge...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2015
Stránek
54
EAN
9781341546969
ISBN
9781341546969
Enbook ID
10183791
Vydavatel
Hmotnost
259
Rozměry
156 x 234 x 6

Kompletní popis

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, yo

Mohlo by vás zajímat

210
228

Theatre Stuff

Eamonn Jordan
546

White Feather

Clare Hegarty
337

Show, Don't Tell

Sandra Gerth
171
156
777

British Sheep Breeds

Susannah Parkin
278
1 314
324
347

Zákaznicí kteří koupili tuto knihu koupili také

Un chien à la mer

Georges Fleury
379

Kahverengi

Birgül Erbil
205
330
196

FRE-BIEN DIT

Holt McDougal
3 657

Pathogenese, 4

H. Cottier
2 490

Wer weiss wohin

Christel Maria Zwillus
330