Euclidean shortest paths : exact or approximate algorithms
Resource Information
The work Euclidean shortest paths : exact or approximate algorithms represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Euclidean shortest paths : exact or approximate algorithms
Resource Information
The work Euclidean shortest paths : exact or approximate algorithms represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Euclidean shortest paths : exact or approximate algorithms
 Title remainder
 exact or approximate algorithms
 Statement of responsibility
 Fajie Li, Reinhard Klette
 Subject

 Computer science  Mathematics
 Computer science  Mathematics
 Computer science  Mathematics
 Computer software
 Discrete Mathematics in Computer Science
 Electronic data processing
 Euclidean algorithm
 Algorithm Analysis and Problem Complexity
 Euclidean algorithm
 Informatique
 MATHEMATICS  Algebra  Intermediate
 Math Applications in Computer Science
 Numeric Computing
 Euclidean algorithm
 Computational complexity
 Computer science
 Language
 eng
 Summary
 The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2 or 3dimensional space? Variants of this industriallysignificant 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 shortestpath 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 thirdyear university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs, the analysis of time complexities, and other related topics. Topics and features: Provides theoretical and programming exercises at the end of each chapter Presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms Discusses algorithms for calculating exact or approximate ESPs in the plane Examines the shortest paths on 3D surfaces, in simple polyhedrons and in cubecurves Describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems Includes lists of symbols and abbreviations, in addition to other appendices This handson guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortestpath problems in practical applications will also find the book a useful resource. Dr. Fajie Li is at Huaqiao University, Xiamen, Fujian, China. Prof. Dr. Reinhard Klette is at the Tamaki Innovation Campus of The University of Auckland
 Cataloging source
 GW5XE
 Dewey number
 512.7
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA166.245
 LC item number
 .L5 2011eb
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
Context
Context of Euclidean shortest paths : exact or approximate algorithmsWork of
No resources found
No enriched resources found
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/resource/PDGvLAdt2lk/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/PDGvLAdt2lk/">Euclidean shortest paths : exact or approximate algorithms</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Euclidean shortest paths : exact or approximate algorithms
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/resource/PDGvLAdt2lk/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/PDGvLAdt2lk/">Euclidean shortest paths : exact or approximate algorithms</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>