The number type leda real provides exact computation for a subset of real algebraic numbers: Every integer is a leda real, and leda reals are closed under the basic arithmetic operations +,−, ∗, / and k-th root operations. leda reals guarantee correct results in all comparison operations. The number type is available as part of the leda C++ software library of efficient data types and algorithm...

During the last years, many software libraries for in-core computation have been developed. Most internal memory algorithms perform very badly when used in an external memory setting. We introduce LEDA-SM that extends the LEDA-library [22] towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called I/O bottleneck. LEDA is...

LEDA and CGAL are platforms for combinatorial and geometric computing. We discuss the use of LEDA and CGAL for geometric computing and show that they provide a unique framework for exact, efficient and convenient geometric computing.

Multiparadigm programming languages have been envisioned as a vehicle for constructing large and complex heterogeneous systems, such as a stock market exchange or a telecommunications network. General-purpose multiparadigm languages, as opposed to hybrid multiparadigm languages, embody several prevalent programming paradigms without being motivated by a single problem. One such language is Leda...

This paper addresses the estimation and control of the domain of attraction (DA) of equilibrium points through rational Lyapunov functions (LFs). Specifically, continuoustime nonlinear systems with polynomial nonlinearities are considered. The estimation problem consists of computing the largest estimate of the DA (LEDA) provided by a given rational LF. The control problem consists of computing...

Multiparadigm programming is a term used to describe a style of software development that makes use of facilities originally designed in support of a number of di erent programming language paradigms. In this paper we illustrate our conception of multiparadigm programming, by describing how various data structures can be implemented in the programming language Leda. Leda is a strongly-typed com...

We describe a robust and efficient implementation of the Karp and Tarzan [4] algorithm for finding the connected components of an undirected graph. The algorithm achieves to find the connected components of a graph G = (V,E) in O(|V|) expected time. The implementation of the algorithm (called GCOMPONENTS) is based on the LEDA library of efficient data types and algorithms [5,6,7]. This is the f...

In order to optimize and validate the design and the operation of its nuclear power plants facilities, EDF (Electricité de France) uses a proprietary tool called LEDA to perform static and dynamic simulation at the system level. EDF wishes to replace LEDA by state-of-the-art off-the-shelf tools, mainly to reduce maintenance cost while keeping up with the latest trend in modeling and simulation ...

Abst rac t . We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We ref...