Klik op een omslag om naar Google Boeken te gaan.
Bezig met laden... Visibility Algorithms in the Planedoor Subir Kumar Ghosh
Geen Bezig met laden...
Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden. Op dit moment geen Discussie gesprekken over dit boek. Geen besprekingen geen besprekingen | voeg een bespreking toe
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. Geen bibliotheekbeschrijvingen gevonden. |
Actuele discussiesGeen
Google Books — Bezig met laden... GenresDewey Decimale Classificatie (DDC)006.37Information Computer Science; Knowledge and Systems Special Topics Artificial Intelligence Machine VisionLC-classificatieWaarderingGemiddelde: Geen beoordelingen.Ben jij dit?Word een LibraryThing Auteur. |