Visibility Algorithms in the Plane (Hardback)Subir Kumar Ghosh (author)
Hardback 332 Pages / Published: 29/03/2007
- We can order this
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.
Publisher: Cambridge University Press
Number of pages: 332
Weight: 810 g
Dimensions: 251 x 177 x 21 mm
You may also be interested in...
Please sign in to write a review
Simply reserve online and pay at the counter when you collect. Available in shop from just two hours, subject to availability.
Thank you for your reservation
Your order is now being processed and we have sent a confirmation email to you at
When will my order be ready to collect?
Following the initial email, you will be contacted by the shop to confirm that your item is available for collection.
Call us on or send us an email at
Unfortunately there has been a problem with your order
Please try again or alternatively you can contact your chosen shop on or send us an email at