Visibility Algorithms in the Plane

Visibility Algorithms in the Plane book cover

Visibility Algorithms in the Plane

Author(s): Subir Kumar Ghosh (Author)

  • Publisher: Cambridge University Press
  • Publication Date: 29 Mar. 2007
  • Edition: Illustrated
  • Language: English
  • Print length: 332 pages
  • ISBN-10: 9780521875745
  • ISBN-13: 9780521875745

Book Description

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.

Editorial Reviews

Review

‘… the book gives a good overview of visibility algorithms in the plane, concentrating on basic algorithms but also covering the state of the art.’ Mathematical Reviews

Book Description

The first book entirely devoted to visibility algorithms in computational geometry.

View on Amazon

电子书代发PDF格式价格30我要求助
未经允许不得转载:Wow! eBook » Visibility Algorithms in the Plane