Visibility Algorithms in the Plane

Visibility Algorithms in the Plane

Publisher: Cambridge University Press
Number Of Pages: 332
Publication Date: 2007-04-09
Sales Rank: 1387314
ISBN / ASIN: 0521875749
EAN: 9780521875745
Binding: Hardcover
Manufacturer: Cambridge University Press
Studio: Cambridge University Press

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.Password: gigapedia.org

http://rapidshare.com/files/53081350/Visibility_Algorithms_in_the_Plane_-_0521875749.pdf.rar