Subir kumar ghosh (32 risultati)

Hardcover. Condizione: Like New. 1. Illus. cloth, no dj. (as issued). Bright, clean copy.

hardcover. Condizione: Used-Very Good. 1st Edition. Library binding. No dj. Very little shelf-wear. Signed.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Hardcover. Condizione: Gut. 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.…

Hardcover. Condizione: Gut. 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.…

Condizione: New. In English.

Paperback. Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 364.

Paperback. Condizione: Brand New. 2013 edition. 363 pages. 9.25x6.00x0.75 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.…

Taschenbuch. Condizione: Neu. WALCOM: Algorithms and Computation | 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings | Subir Kumar Ghosh (u. a.) | Taschenbuch | xiv | Englisch | 2013 | Springer | EAN 9783642360640 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 364 | Sprache: Englisch | Produktart: Bücher | This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.…

Condizione: New.

Condizione: New. In English.

Condizione: 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. . . . . …

Condizione: 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. . . . . Books ship from the US and Ireland. …

Hardcover. Condizione: Brand New. 1st edition. 318 pages. 9.75x7.25x0.75 inches. In Stock.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing. 364 pp. Englisch.…

Condizione: New. Print on Demand pp. 364 101 Illus.

Condizione: New. PRINT ON DEMAND pp. 364.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. State-of-the-art research Fast-track conference proceedings Unique visibilityThis book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, i.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 364 pp. Englisch.…

Hardcover. Condizione: 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.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 the. …