Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 67.59
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Published by VDM Verlag 2009-06-09, 2009
ISBN 10: 3639162951 ISBN 13: 9783639162950
Language: English
Seller: Chiron Media, Wallingford, United Kingdom
US$ 62.93
Convert currencyQuantity: 10 available
Add to basketPaperback. Condition: New.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
US$ 68.71
Convert currencyQuantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by VDM Verlag Dr. Müller, 2009
ISBN 10: 3639162951 ISBN 13: 9783639162950
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 71.63
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: 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.