Skip to content
Register Sign in Wishlist

Visibility Algorithms in the Plane

$115.00 USD

  • Date Published: June 2007
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9780511282324

$ 115.00 USD
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Other available formats:
Hardback


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • First book entirely devoted to visibility algorithms in computational geometry, useful to researchers in algorithms, robotics, computer graphics and geometric graph theory
    • Algorithms from the book can be used in a first course in computational geometry
    • Contains over 300 figures and over 100 exercises, making it ideal as a graduate textbook
    Read more

    Reviews & endorsements

    '… 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

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 2007
    • format: Adobe eBook Reader
    • isbn: 9780511282324
    • contains: 333 b/w illus. 108 exercises
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • Table of Contents

    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.

  • Author

    Subir Kumar Ghosh, Tata Institute of Fundamental Research, Mumbai, India
    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.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×