Euclidean Shortest Paths_ Exact or Approximate Algorithms [Li & Klette 2011-11-04].pdf

(6422 KB) Pobierz
Euclidean Shortest Paths
“Beauty on the Path”, a digital painting by Stephen Li (Auckland, New Zealand),
September 2011, provided as a gift for this book.
Fajie Li
r
Reinhard Klette
Euclidean
Shortest Paths
Exact or Approximate Algorithms
Fajie Li
School of Information Science
and Technology
Huaqiao University
P.O. Box 800
Xiamen Fujian
People’s Republic of China
li.fajie@yahoo.com
Reinhard Klette
Dept. Computer Science
University of Auckland
P.O. Box 92019
Auckland 1142
New Zealand
r.klette@auckland.ac.nz
ISBN 978-1-4471-2255-5
e-ISBN 978-1-4471-2256-2
DOI 10.1007/978-1-4471-2256-2
Springer London Dordrecht Heidelberg New York
British Library Cataloguing in Publication Data
A catalogue record for this book is available from the British Library
Library of Congress Control Number: 2011941219
© Springer-Verlag London Limited 2011
Apart from any fair dealing for the purposes of research or private study, or criticism or review, as per-
mitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced,
stored or transmitted, in any form or by any means, with the prior permission in writing of the publish-
ers, or in the case of reprographic reproduction in accordance with the terms of licenses issued by the
Copyright Licensing Agency. Enquiries concerning reproduction outside those terms should be sent to
the publishers.
The use of registered names, trademarks, etc., in this publication does not imply, even in the absence of a
specific statement, that such names are exempt from the relevant laws and regulations and therefore free
for general use.
The publisher makes no representation, express or implied, with regard to the accuracy of the information
contained in this book and cannot accept any legal responsibility or liability for any errors or omissions
that may be made.
Cover design:
VTeX UAB, Lithuania
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)
Zgłoś jeśli naruszono regulamin