Comments:
*******************************************************************************<br />
Visibility Algorithms in the Plane <br />
*******************************************************************************<br />
<br />
-------------------------------------------------------------------------------<br />
General Information<br />
-------------------------------------------------------------------------------<br />
Type.................: Ebook<br />
Part Size............: 2,737,245 bytes<br />
<br />
<br />
<br />
<br />
-------------------------------------------------------------------------------<br />
Post Information<br />
-------------------------------------------------------------------------------<br />
Posted by............: ~tqw~<br />
<br />
-------------------------------------------------------------------------------<br />
Release Notes<br />
-------------------------------------------------------------------------------<br />
A human observer can effortlessly identify visible portions of geometric objects <br />
present in the environment. However, such computations of visible portions of <br />
objects from a viewpoint involving thousands of objects is a time-consuming task <br />
even for high-speed computers. To solve such visibility problems, efficient <br />
algorithms have been designed in computational geometry over the last three <br />
decades. This book presents some of these visibility algorithms in two <br />
dimensions. Specifically, basic algorithms for point visibility, weak <br />
visibility, shortest paths, visibility graphs, link paths and visibility queries <br />
are all discussed. Several geometric properties are also established through <br />
lemmas and theorems.<br />
<br />
With over 300 figures and hundreds of exercises, this book is ideal for graduate <br />
students and researchers in the field of computational geometry. It will also be <br />
useful as a reference for researchers working in algorithms, robotics, computer <br />
graphics and geometric graph theory. Readers need only a background in <br />
algorithms and data structures for understanding this book, and some algorithms <br />
from the book can be used in a first course in computational geometry.<br />
<br />
Table Of Contents<br />
<br />
Preface page xi<br />
1 Background 1<br />
2 Point Visibility 13<br />
3 Weak Visibility and Shortest Paths 46<br />
4 LR-Visibility and Shortest Paths 105<br />
5 Visibility Graphs 136<br />
6 Visibility Graph Theory 171<br />
7 Visibility and Link Paths 218<br />
8 Visibility and Path Queries 255<br />
Bibliography 295<br />
Index 311<br />
<br />
Product Details<br />
<br />
* ISBN: 0521875749<br />
* ISBN-13: 9780521875745<br />
* Format: Hardcover, 350pp<br />
* Publisher: Cambridge University Press<br />
* Pub. Date: March 2007<br />
<br />
-------------------------------------------------------------------------------<br />
Install Notes<br />
-------------------------------------------------------------------------------<br />
PDF Reader<br />
Add comment