Visibility Algorithms in the Plane (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	March 2007
First published:	2007
Authors:	Subir Kumar Ghosh
Dimensions:	252 x 178 x 20mm (L x W x T)
Format:	Hardcover
Pages:	332
ISBN-13:	978-0-521-87574-5
Categories:	Books > Computing & IT > Applications of computing > Image processing > General
LSN:	0-521-87574-9
Barcode:	9780521875745

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!