� propos de l?auteur: 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.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

D�tails bibliographiques

Titre : Visibility Algorithms in the Plane
�diteur : Cambridge University Press
Date d'�dition : 2007
Reliure : Couverture rigide
Etat : Used - Like New
Edition : Edition originale

Meilleurs r�sultats de recherche sur AbeBooks

Image d'archives

Visibility Algorithms in the Plane

Subir Kumar Ghosh

Edit� par Cambridge University Press, 2007

ISBN 10 : 0521875749 ISBN 13 : 9780521875745

Neuf Couverture rigide Edition originale

Vendeur : Book Dispensary, Concord, ON, Canada

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : New. 1st Edition. BRAND NEW hardcover. Book. N� de r�f. du vendeur 118210

Contacter le vendeur

Acheter neuf

EUR 39,57

EUR 5,97 shipping
Exp�dition depuis Canada vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Visibility Algorithms in the Plane (Hardcover)

Subir Kumar Ghosh

Edit� par Cambridge University Press, Cambridge, 2007

ISBN 10 : 0521875749 ISBN 13 : 9780521875745

Neuf Couverture rigide Edition originale

impression � la demande

Vendeur : CitiRetail, Stevenage, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : new. Hardcover. 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. 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 and this book presents some of these visibility algorithms in two dimensions. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N� de r�f. du vendeur 9780521875745

Contacter le vendeur

Acheter neuf

EUR 152,92

EUR 42,26 shipping
Exp�dition depuis Royaume-Uni vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Visibility Algorithms in the Plane (Hardcover)

Subir Kumar Ghosh

Edit� par Cambridge University Press, Cambridge, 2007

ISBN 10 : 0521875749 ISBN 13 : 9780521875745

Neuf Couverture rigide Edition originale

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : new. Hardcover. 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. 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 and this book presents some of these visibility algorithms in two dimensions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N� de r�f. du vendeur 9780521875745

Contacter le vendeur

Acheter neuf

EUR 155,72

Livraison gratuite
Exp�dition nationale�: Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Visibility Algorithms in the Plane (Hardcover)

Subir Kumar Ghosh

Edit� par Cambridge University Press, Cambridge, 2007

ISBN 10 : 0521875749 ISBN 13 : 9780521875745

Neuf Couverture rigide Edition originale

impression � la demande

Vendeur : AussieBookSeller, Truganina, VIC, Australie

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : new. Hardcover. 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. 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 and this book presents some of these visibility algorithms in two dimensions. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N� de r�f. du vendeur 9780521875745

Contacter le vendeur

Acheter neuf

EUR 198,33

EUR 31,59 shipping
Exp�dition depuis Australie vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Visibility Algorithms in the Plane

Subir Kumar Ghosh

A propos de cet article

Description :

Synopsis :

D�tails bibliographiques

Meilleurs r�sultats de recherche sur AbeBooks

Visibility Algorithms in the Plane

Acheter neuf

Visibility Algorithms in the Plane (Hardcover)

Acheter neuf

Visibility Algorithms in the Plane (Hardcover)

Acheter neuf

Visibility Algorithms in the Plane (Hardcover)

Acheter neuf