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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: Powell's Bookstores Chicago, ABAA, Chicago, IL, U.S.A.
hardcover. Condition: Used-Very Good. 1st Edition. Library binding. No dj. Very little shelf-wear. Signed. Seller Inventory # 1728944
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 65 GHO 9780521875745 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2502074
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 65 GHO 9780521875745 Sprache: Englisch Gewicht in Gramm: 1150. Seller Inventory # 2508148
Seller: StainesBook, Weybridge, SURRE, United Kingdom
Seller Inventory # SpeedList-3755
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521875745
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521875745_new
Quantity: Over 20 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: 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 multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521875745
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 318 pages. 9.75x7.25x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __0521875749
Quantity: 1 available
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. The first book entirely devoted to visibility algorithms in computational geometry. Num Pages: 332 pages, 333 b/w illus. 108 exercises. BIC Classification: UYT. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 20. Weight in Grams: 818. . 2007. Illustrated. hardcover. . . . . Seller Inventory # V9780521875745
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780521875745
Quantity: Over 20 available