Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Visibility Algorithms in the Plane
Engleski
375 b
Do 30 dana za povrat
Kupci su kupili i
/
Meki uvez
9.67
€
/
Meki uvez
10.58
€
/
Meki uvez
44.37
€
A human observer can effortlessly identify visible portions of geometric objects present in the environment. However, computations of visible portions of objects from a viewpoint involving thousands of objects is a time consuming task even for high speed computers. To solve such visibility problems, efficient algorithms have been designed. This book presents some of these visibility algorithms in two dimensions. Specifically, basic algorithms for point visibility, weak visibility, shortest paths, visibility graphs, link paths and visibility queries are all discussed. Several geometric properties are also established through lemmas and theorems. With over 300 figures and hundreds of exercises, this book is ideal for graduate students and researchers in the field of computational geometry. It will also be useful as a reference for researchers working in algorithms, robotics, computer graphics and geometric graph theory, and some algorithms from the book can be used in a first course in computational geometry.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Tvrdi uvez
53.45
€
/
Meki uvez
218.06
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?