Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 57,46
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 62,24
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 53,49
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 58,41
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 62,09
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: moluna, Greven, Alemania
EUR 46,32
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: 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.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 59,71
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.