The Resource Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette
Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette
Resource Information
The item Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
- Summary
- 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, 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 cube-curves 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 hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path 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
- Language
- eng
- Extent
- 1 online resource (xvii, 376 pages)
- Contents
-
- pt. 1. Discrete or continuous shortest paths
- pt. 2. Paths in the plane
- pt. 3. Paths in 3-dimensional space
- pt. 4. Art galleries
- Isbn
- 9781447122562
- Label
- Euclidean shortest paths : exact or approximate algorithms
- Title
- Euclidean shortest paths
- 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 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, 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 cube-curves 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 hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path 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
- http://library.link/vocab/creatorName
- Li, Fajie
- 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
- http://library.link/vocab/relatedWorkOrContributorName
- Klette, Reinhard
- http://library.link/vocab/subjectName
-
- Euclidean algorithm
- Computer science
- MATHEMATICS
- Informatique
- Computer science
- Euclidean algorithm
- Label
- Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- pt. 1. Discrete or continuous shortest paths -- pt. 2. Paths in the plane -- pt. 3. Paths in 3-dimensional space -- pt. 4. Art galleries
- Control code
- 760288690
- Dimensions
- unknown
- Extent
- 1 online resource (xvii, 376 pages)
- File format
- unknown
- Form of item
- online
- Isbn
- 9781447122562
- Lccn
- 2011941219
- Level of compression
- unknown
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-1-4471-2256-2
- Other physical details
- color illustrations
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)760288690
- Label
- Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- pt. 1. Discrete or continuous shortest paths -- pt. 2. Paths in the plane -- pt. 3. Paths in 3-dimensional space -- pt. 4. Art galleries
- Control code
- 760288690
- Dimensions
- unknown
- Extent
- 1 online resource (xvii, 376 pages)
- File format
- unknown
- Form of item
- online
- Isbn
- 9781447122562
- Lccn
- 2011941219
- Level of compression
- unknown
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-1-4471-2256-2
- Other physical details
- color illustrations
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)760288690
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
Library Links
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 fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Euclidean-shortest-paths--exact-or-approximate/KV1GzCaeBt4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Euclidean-shortest-paths--exact-or-approximate/KV1GzCaeBt4/">Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette</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 Item Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Euclidean-shortest-paths--exact-or-approximate/KV1GzCaeBt4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Euclidean-shortest-paths--exact-or-approximate/KV1GzCaeBt4/">Euclidean shortest paths : exact or approximate algorithms, Fajie Li, Reinhard Klette</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>