//]]>

Euclidean Shortest Paths (Record no. 21076)

000 -LEADER
fixed length control field 04090nam a22005055i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151110.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 111102s2011 xxk| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781447122562
978-1-4471-2256-2
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
264 #1 -
-- London :
-- Springer London :
-- Imprint: Springer,
-- 2011.
912 ## -
-- ZDB-2-SCS
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Li, Fajie.
Relator term author.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Euclidean Shortest Paths
Medium [electronic resource] :
Remainder of title Exact or Approximate Algorithms /
Statement of responsibility, etc by Fajie Li, Reinhard Klette.
300 ## - PHYSICAL DESCRIPTION
Extent XVIII, 378 p.
Other physical details online resource.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Part I: Discrete or Continuous Shortest Paths -- Euclidean Shortest Paths -- Deltas and Epsilons -- Rubberband Algorithms -- Part II: Paths in the Plane -- Convex Hulls in the Plane -- Partitioning a Polygon or the Plane -- Approximate ESP Algorithms -- Part III: Paths in Three-Dimensional Space -- Paths on Surfaces -- Paths in Simple Polyhedrons -- Paths in Cube Curves -- Part IV: Art Galleries -- Touring Polygons -- Watchman Route -- Safari and Zookeeper Problems.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Electronic data processing.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Optical pattern recognition.
Topical term or geographic name as entry element Computer aided design.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Numeric Computing.
Topical term or geographic name as entry element Pattern Recognition.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Math Applications in Computer Science.
Topical term or geographic name as entry element Computer-Aided Engineering (CAD, CAE) and Design.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Klette, Reinhard.
Relator term author.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9781447122555
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-1-4471-2256-2
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-08AUM Main Library2014-04-08 2014-04-08 E-Book   AUM Main Library005.1

Languages: 
English |
العربية