EXACUS Efficient and Exact Algorithms for Curves and Surfaces

News

• July 2007: The new xalci-webdemo is in place. It allows to analyse and render real plane algebraic curves of arbitrary degree.
• August 2006: EXACUS public release 1.0 available from the download section.

Overview

A new project at the Algorithms and Complexity Group (AG1) at the Max-Planck-Institut für Informatik. We work on a set of libraries for efficient and exact algorithms for curves and surfaces (work in progress):

• Library Support (LiS): provides configuration, assertion, IO, and other low level support for software libraries.

• NumeriX (NiX): provides number type support, polynomials, matrices, numerical and exact methods for solving polynomial equations, determinants, and more.

• SweepX (SoX): computes arrangements of curves in the plane and performs boolean operations on polygons with curve-segment edges using a sweep-line algorithm.

• ConiX (CnX): provides conics in the plane, predicates on conics and their intersections.

• CubiX (CbX): provides cubic curves in the plane, predicates on cubic curves and their intersections. A first prototype implementation computing arrangements of cubic curves is available. [for ECG Members only]

• QuadriX (QdX): provides quadrics in space, predicates on quadrics, their intersection curves and points, and computes the arrangement of quadrics in space.

Contents

• Bachelor- and Mastertheses
• Teaching
• Publications
• Downloads

• Members only