Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 56,63
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 53,98
Anzahl: 10 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Topics in Computational Geometry | Robust Geometric Computing and Optimal Visibility Coverage | Eli Packer | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2009 | VDM Verlag Dr. Müller | EAN 9783639162950 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 57,80
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: moluna, Greven, Deutschland
EUR 46,32
Anzahl: Mehr als 20 verfügbar
In den WarenkorbKartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Packer EliDr. Eli Packer works at IBM Research Center in Hawthorne, NewnYork. He received a B.Sc. and an M.Sc. in Computer Science from TelnAviv University, and a Ph.D. from the Department of ComputernScience at Stony Brook Universit.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book presents work in two of the most popularareas of geometric computation: Robust GeometricComputing and Optimal Visibility Coverage. Both areashave been extensively researched in recent years andattracted the attention of many researchers andsoftware developers. (1) Implementation of geometricalgorithms is generally difficult because one mustdeal with both precision problems and degenerateinput. Overlooking these issues often result inprogram errors or crashes. The first part of thisbook presents algorithms to approximate anarrangement of line segments, which is a basic andimportant geometric data structure, in order to makeit more robust for further manipulation andcomputation. (2) The optimal visibility coverageproblem, often called the 'art gallery problem', isone of the classic geometric problems. The input forthe problem is a geometric domain and the challengeis to minimize the number of guards that cover, orsee, the domain. This topic is motivated by problemsin surveillance, sensor networking, illumination andmore. The second part of this book presentsalgorithms for some of the most popular visibilitycoverage problems.