LEDA: Platform for Combinatorial & Geometric Computing by Mehlhorn & Naher
LEDA: Platform for Combinatorial & Geometric Computing - 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. Geometry Kernels
10. Geometry Algorithms
11. Windows
12. GraphWin
13. On the Implementation of LEDA
14. Manual Pages and Documentation
What You Will Learn in LEDA: Platform for Combinatorial & Geometric Computing
"LEDA: A Platform for Combinatorial & Geometric Computing" by "Kurt Mehlhorn" and "Stefan Näher" is a comprehensive book that introduces "LEDA", a powerful C++ software library designed for "algorithm engineering". The book explains how theoretical algorithms can be transformed into reliable, efficient, and reusable software components, bridging the gap between theory and practice.
The authors present a wide range of "data structures" and "algorithms" for combinatorial and "computational geometry" problems. Topics include graphs, network flows, priority queues, planar subdivisions, convex hulls, and geometric searching. Each concept is supported with clean interfaces, well-tested implementations, and clear explanations that emphasize correctness and performance.
Aimed at advanced students, researchers, and software engineers, the book is both a technical reference and a practical guide. It demonstrates how a unified platform like LEDA supports rapid development of complex algorithmic solutions while maintaining robustness. Widely used in academia and research, the book remains a key resource for those working with "geometric computing", "combinatorial algorithms", and high-quality algorithm libraries.
Book Details & Specifications
Title:
LEDA: Platform for Combinatorial & Geometric Computing by Mehlhorn & Naher
Publisher:
Cambridge University Press
Year:
1999
Pages:
1034
Type:
PDF
Language:
English
ISBN-10 #:
0521563291
ISBN-13 #:
978-0521563291
License:
External Educational Resource
Amazon:
Amazon
About the Author: Kurt Mehlhorn and Stefan Näher
The author Kurt Mehlhorn and Stefan Näher
are leading computer scientists known for their work in "algorithm design" and "computational geometry". Mehlhorn, a prominent "German computer scientist", has made major contributions to efficient algorithms, data structures, and algorithm engineering. Stefan Näher specializes in "software engineering" and algorithm implementation. Together, they created "LEDA", a powerful "algorithm library" that turns theoretical combinatorial and geometric algorithms into reliable, practical software used worldwide.
Read or Downloadable LEDA: Platform for Combinatorial & Geometric Computing
Free Computational Geometry Books PDF | Algorithm Design Resources