0
Your cart

Your cart is empty

Books > History

Buy Now

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons (Paperback) Loot Price: R440
Discovery Miles 4 400
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons (Paperback): Leonidas J Guibas, M....

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons (Paperback)

Leonidas J Guibas, M. Sharir

 (sign in to rate)
Loot Price R440 Discovery Miles 4 400

Bookmark and Share

Expected to ship within 10 - 15 working days

General

Imprint: Palala Press
Release date: March 2018
Authors: Leonidas J Guibas • M. Sharir
Dimensions: 234 x 156 x 3mm (L x W x T)
Format: Paperback - Trade
Pages: 54
ISBN-13: 978-1-379-06969-0
Categories: Books > Humanities > History > General
Books > History > General
Promotions
LSN: 1-379-06969-6
Barcode: 9781379069690

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners