Skip to main content
×
×
Home
Visibility Algorithms in the Plane
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 63
  • Cited by
    This (lowercase (translateProductType product.productType)) has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Saha, Sourav Mandal, Ankita Sheth, Paras Narnoli, Harshita and Mahapatra, Priya  Ranjan  Sinha  2017. Computational Intelligence, Communications, and Business Analytics. Vol. 776, Issue. , p. 284.

    Inkulu, R. and Thakur, Nitish P. 2017. Algorithms and Discrete Applied Mathematics. Vol. 10156, Issue. , p. 205.

    Nouri Bygi, M. and Ghodsi, M. 2017. Weak visibility queries of line segments in simple polygons and polygonal domains. International Journal of Computer Mathematics, p. 1.


    Emadi, Hamid Gao, Tianshuang and Bhattacharya, Sourabh 2017. Visibility-Based Target-Tracking Game: Bounds and Tracking Strategies. IEEE Robotics and Automation Letters, Vol. 2, Issue. 4, p. 1917.


    Bahoo, Yeganeh Banyassady, Bahareh Bose, Prosenjit Durocher, Stephane and Mulzer, Wolfgang 2017. WALCOM: Algorithms and Computation. Vol. 10167, Issue. , p. 308.

    Diwan, Ajit Arvind and Roy, Bodhayan 2017. Algorithms and Discrete Applied Mathematics. Vol. 10156, Issue. , p. 156.

    Sheshkalani, Ali Narenji Khosravi, Ramtin and Mohammadi, Mayssam 2017. Towards Autonomous Robotic Systems. Vol. 10454, Issue. , p. 51.

    Altahir, Altahir Abdalla Asirvadam, Vijanth Sagayan Hamid, Nor Hisham B. Sebastian, Patrick Saad, Nordin B. Ibrahim, Rosdiazli B. and Dass, Sarat C. 2017. Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming. IEEE Sensors Journal, Vol. 17, Issue. 11, p. 3398.


    Aichholzer, Oswin Kusters, Vincent Mulzer, Wolfgang Pilz, Alexander and Wettstein, Manuel 2017. An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. International Journal of Computational Geometry & Applications, Vol. 27, Issue. 01n02, p. 57.


    Cardinal, Jean and Hoffmann, Udo 2017. Recognition and Complexity of Point Visibility Graphs. Discrete & Computational Geometry, Vol. 57, Issue. 1, p. 164.


    Fox-Epstein, Eli Tóth, Csaba D. and Winslow, Andrew 2016. Diffuse Reflection Radius in a Simple Polygon. Algorithmica, Vol. 76, Issue. 4, p. 910.


    Sergey, Ilya 2016. Experience report: growing and shrinking polygons for random testing of computational geometry algorithms. p. 193.

    Tozoni, Davi C. Rezende, Pedro J. De and Souza, Cid C. De 2016. Algorithm 966. ACM Transactions on Mathematical Software, Vol. 43, Issue. 2, p. 1.


    Jaklin, Norman and Geraerts, Roland 2016. Handbook of Research on Gaming Trends in P-12 Education. p. 527.

    Alipour, Sharareh Ghodsi, Mohammad and Jafari, Amir 2016. Computing and Combinatorics. Vol. 9797, Issue. , p. 209.

    Tsardoulias, E. G. Iliakopoulou, A. Kargakos, A. and Petrou, L. 2016. A Review of Global Path Planning Methods for Occupancy Grid Maps Regardless of Obstacle Density. Journal of Intelligent & Robotic Systems, Vol. 84, Issue. 1-4, p. 829.


    Maheshwari, Anil Nandy, Subhas C. Pattanayak, Drimit Roy, Sasanka and Smid, Michiel 2016. Geometric Path Problems with Violations. Algorithmica,


    Sergey, Ilya 2016. Experience report: growing and shrinking polygons for random testing of computational geometry algorithms. ACM SIGPLAN Notices, Vol. 51, Issue. 9, p. 193.


    Adiceam, Faustin 2016. How Far Can You See in a Forest?. International Mathematics Research Notices, Vol. 2016, Issue. 16, p. 4867.


    Roy, Bodhayan 2016. Point Visibility Graph Recognition is NP-Hard. International Journal of Computational Geometry & Applications, Vol. 26, Issue. 01, p. 1.


    ×
  • Export citation
  • Recommend to librarian
  • Recommend this book

    Email your librarian or administrator to recommend adding this book to your organisation's collection.

    Visibility Algorithms in the Plane
    • Online ISBN: 9780511543340
    • Book DOI: https://doi.org/10.1017/CBO9780511543340
    Please enter your name
    Please enter a valid email address
    Who would you like to send this to *
    ×
  • Buy the print book

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.

Reviews

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

Source: Mathematical Reviews

Refine List
Actions for selected content:
Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive
  • Send content to

    To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

    To send content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

    Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Please be advised that item(s) you selected are not available.
    You are about to send
    ×

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
×

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 102 *
Loading metrics...

Book summary page views

Total views: 333 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 16th December 2017. This data will be updated every 24 hours.