VISIBILITY ALGORITHMS IN THE PLANE

Le Monde En Tique

Commandez cet ouvrage

Ouvrage 9780521875745 : VISIBILITY ALGORITHMS IN THE PLANE

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.
* First book entirely devoted to visibility algorithms in computational geometry, useful to researchers in algorithms, robotics, computer graphics and geometric graph theory
* Algorithms from the book can be used in a first course in computational geometry
* Contains over 300 figures and over 100 exercises, making it ideal as a graduate textbook
Contents
Preface; 1. Background; 2. Point visibility; 3. Weak visibility and shortest paths; 4. L-R visibility and shortest paths; 5. Visibility graphs; 6. Visibility graph theory; 7. Visibility and link paths; 8. Visibility and path queries; Bibliography; Index.


Auteur : GOSH
Editeur : CAMBRIDGE UNIVERSITY PRESS
Nombre de pages : 318
Date de publication : 03 2007

Commandez cet ouvrage