Visibility Algorithms in the Plane - Hardcover

Ghosh, Subir Kumar

Hardcover

ISBN 10: 0521875749 ISBN 13: 9780521875745

Publisher: Cambridge University Press, 2007

Synopsis

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.

About this title

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:

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 and this book presents some of these visibility algorithms in two dimensions.

About this edition

• Publisher: Cambridge University Press
• Publication date: 2007
• ISBN 10: 0521875749
• ISBN 13: 9780521875745
• Binding: Hardcover
• Number of pages: 332