Skip to content
Register Sign in Wishlist
Look Inside LEDA

A Platform for Combinatorial and Geometric Computing
2 Part Paperback Set


  • Date Published: June 2009
  • availability: Available
  • format: Multiple copy pack
  • isbn: 9780521109413

£ 67.00
Multiple copy pack

Add to cart Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing on which application programs can be built. In each of the core computer science areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library; it is written in C++ and is available on many types of machine. Whilst the software is freely available worldwide and is installed at hundreds of sites, this is the first book devoted to the library. Written by the main authors of LEDA, it is the definitive account, describing how the system is constructed and operates and how it can be used. The authors supply ample examples from a range of areas to show how the library can be used in practice, making the book essential for all workers in algorithms, data structures and computational geometry.

    • Definitive book on the only software library for geometric computing
    • Written by authors of the library
    • Covers the details of the library plus its use through examples
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: June 2009
    • format: Multiple copy pack
    • isbn: 9780521109413
    • dimensions: 252 x 324 x 68 mm
    • weight: 2.22kg
    • contains: 120 b/w illus.
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Foundations
    3. Basic data types
    4. Numbers and matrices
    5. Advanced data types
    6. Graphs and their data structures
    7. Graph algorithms
    8. Embedded graphs
    9. The geometry kernels
    10. Geometry algorithms
    11. Windows and panels
    12. GraphWin
    13. On the implementation of LEDA
    14. Manual pages and documentation

  • Authors

    Kurt Mehlhorn, Max-Planck-Institut für Informatik, Saarbruecken

    Stefan Näher, Universität Trier, Germany

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.