Visibility Algorithms in the Plane
1st Edition
Published on 13. June 2007
978-0-511-28232-4 (ISBN)
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.
Reviews / Votes
'... 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 ReviewsMore details
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 333 Line drawings, unspecified
File size
2,66 MB
ISBN-13
978-0-511-28232-4 (9780511282324)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Subir Kumar Ghosh
Visibility Algorithms in the Plane
Book
03/2007
Cambridge University Press
€150.30
Shipment within 15-20 days
Person
Subir Kumar Ghosh is a Professor of Computer Science at the Tata Institute of Fundamental Research, Mumbai, India and is a Fellow of the Indian Academy of Sciences. He is the author of around forty papers in the fields of Computational Geometry and Graph Theory and has worked as a visiting scientist in many reputed universities and research institutes around the world.
Content
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.
