EXACUS 0.9 Released, Efficient and Exact Algorithms for Curves and Surfaces

Lutz Kettner kettner at mpi-sb.mpg.de
Thu Dec 2 13:17:41 PST 2004

We are pleased to announce the first public release 0.9 of EXACUS --
Efficient and Exact Algorithms for Curves and Surfaces -- containing
a set of C++ libraries under an open source license:

  - ConiX Library (CnX): Provides conics in the plane, predicates on
    conics and their intersections, and computes the arrangement of
    conics in the plane, either based on our own sweep-line algorithm
    in the SweepX Library or based on the CGAL arrangements class for
    which we provide a traits class.

  - SweepX Library (SoX): Provides a generic sweep line algorithm to
    compute the planar arrangement of segments of algebraic curves.

  - NumeriX Library (NiX): Provides the algebraic and numerical
    foundations with number type support, polynomials, matrices,
    numerical and exact methods for solving polynomial equations,
    determinants, resultants, and more.

  - Library Support (LiS): Acts as a foundation layer and provides
    configuration, assertion, IO, memory management, generic
    algorithms, and other low level support for software libraries.

We are also pleased to announce the release of the LEDA real
Extended (EXT) implementation as part of the EXACUS project:

  - LEDA real Extended (EXT): An extended version of the LEDA real
    number type that contains the new diamond operator and improved
    separation bounds. The diamond operator introduces the exact
    computation with real roots of polynomials. The coefficients of
    the polynomial are not restricted to integers but can be of the
    EXT type itself.

EXACUS is a project at the Algorithms and Complexity Group (AG1) at
the Max-Planck-Institut für Informatik in Saarbrücken, Germany, since
2001. For further information and for downloading the library,
please visit:


Best regards,

Lutz Kettner

Max-Planck-Institut fur Informatik        email: kettner at mpi-sb.mpg.de
Stuhlsatzenhausweg 85                     phone: +49-681-9325-106
66123 Saarbrucken, Germany                fax:   +49-681-9325-199

The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.

More information about the Compgeom-announce mailing list