Omschrijving

The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas and avoid defined obstacles. This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Suitable for a second- or third-year university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs,

Kenmerken

Artikelnummer9200000034337223
EAN9781447122562
CategorieDigital Reading
ProductgroepBoeken
SegmentTextual/Printed/Reference Materials
Prijs Nederland€ 148,99
Prijs België€ 148,99
Verzendkosten NLGratis
Verzendkosten BEGratis
Levertijd NederlandMorgen in huis
Levertijd BelgiëMorgen in huis
VerkoperPartner

Euclidean Shortest Paths bestellen bij snelkeus

Koop Euclidean Shortest Paths van Onbekend online in de categorie Digital Reading. Prijs € 148,99, levering in Nederland · Morgen in huis.