Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Online ordering will be unavailable from Sunday, October 5 at 08:00 GMT until 18:00 GMT .

To place an order, please contact Customer Services.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Recommended product

Popular links

Popular links


LEDA 2 Part Paperback Set

LEDA

LEDA

A Platform for Combinatorial and Geometric Computing
Authors:
Kurt Mehlhorn, Max-Planck-Institut für Informatik, Saarbruecken
Stefan Näher, Universität Trier, Germany
Published:
No date available
Format:
Hardback
ISBN:
9780521563291
Hardback

    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

    Product details

    No date available
    Hardback
    9780521563291
    1034 pages
    255 × 195 × 57 mm
    1.97kg
    120 b/w illus.

    Table of Contents

    • Preface
    • 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
    • Bibliography
    • Index.
      Authors
    • Kurt Mehlhorn , Max-Planck-Institut für Informatik, Saarbruecken
    • Stefan Näher , Universität Trier, Germany