Packer Eli (10 results)

- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 64.96
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 68.74
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.

- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 67.37
US$ 16.12 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.

- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 67.35
US$ 20.18 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 74.19
US$ 20.18 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.

- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 60.65
US$ 80.67 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Topics in Computational Geometry | Robust Geometric Computing and Optimal Visibility Coverage | Eli Packer | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639162950 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de |…Anbieter: preigu.

- Softcover
- Print on Demand
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 67.61
Free ShippingShips within U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

- Softcover
- Print on Demand
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 68.11
US$ 5.60 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
PAP. 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.

- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 54.98
US$ 56.46 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Kartoniert / Broschiert. Condition: 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.

- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 70.87
US$ 70.41 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. 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 re…searchers 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.