EXACUS: efficient and exact algorithms for curves and surfaces

Authors:
Eric Berberich;Arno Eigenwillig;Michael Hemmer;Susan Hert;Lutz Kettner;Kurt Mehlhorn;Joachim Reichel;Susanne Schmitt;Elmar Schömer;Nicola Wolpert
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Johannes-Gutenberg-Universität Mainz, Germany;Serials Solutions, Seattle, WA;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Johannes-Gutenberg-Universität Mainz, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 22
Cited 22

Generic programming and the STL: using and extending the C++ Standard Template Library

Generic programming and the STL: using and extending the C++ Standard Template Library
A core library for robust numeric and geometric computation

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
MAPC: a library for efficient and exact manipulation of algebraic points and curves

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
On the design of CGAL a computational geometry algorithms library

Software—Practice & Experience - Special issue on discrete algorithm engineering
The design and implementation of panar maps in CGAL

Journal of Experimental Algorithmics (JEA)
ESOLID---A System for Exact Boundary Evaluation

Proceedings of the seventh ACM symposium on Solid modeling and applications
Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches

Computational Discrete Mathematics
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
An Adaptable and Extensible Geometry Kernel

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Applications of the Generic Programming Paradigm in the Design of CGAL

Selected Papers from the International Seminar on Generic Programming
High-Level Filtering for Arrangements of Conic Arcs

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polynomial real root isolation using Descarte's rule of signs

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Complete, exact, and efficient computations with cubic curves

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Towards and open curved kernel

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On the exact computation of the topology of real algebraic curves

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Algorithms for Reporting and Counting Geometric Intersections

IEEE Transactions on Computers
A descartes algorithm for polynomials with bit-stream coefficients

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
The diamond operator: implementation of exact real algebraic numbers

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Exact, efficient, and complete arrangement computation for cubic curves

Computational Geometry: Theory and Applications
A real-time and exact implementation of the predicates for the Voronoi diagram of parametric ellipses

Proceedings of the 2007 ACM symposium on Solid and physical modeling
An exact, complete and efficient computation of arrangements of Bézier curves

Proceedings of the 2007 ACM symposium on Solid and physical modeling
An adaptable and extensible geometry kernel

Computational Geometry: Theory and Applications
Advanced programming techniques applied to Cgal's arrangement package

Computational Geometry: Theory and Applications
A package for exact kinetic data structures and sweepline algorithms

Computational Geometry: Theory and Applications
Fast and exact geometric analysis of real algebraic plane curves

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Exact and efficient 2D-arrangements of arbitrary algebraic curves

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Exact arrangements on tori and Dupin cyclides

Proceedings of the 2008 ACM symposium on Solid and physical modeling
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces

Proceedings of the 2008 ACM symposium on Solid and physical modeling
Exact and efficient evaluation of the InCircle predicate for parametric ellipses and smooth convex objects

Computer-Aided Design
Real Algebraic Numbers: Complexity Analysis and Experimentation

Reliable Implementation of Real Number Algorithms: Theory and Practice
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces

Computer Aided Geometric Design
Univariate Algebraic Kernel and Application to Arrangements

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Experimental evaluation and cross-benchmarking of univariate real solvers

Proceedings of the 2009 conference on Symbolic numeric computation
Exact, efficient, and complete arrangement computation for cubic curves

Computational Geometry: Theory and Applications
Complete, exact and efficient implementation for computing the adjacency graph of an arrangement of quadrics

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Sweeping and maintaining two-dimensional arrangements on surfaces: a first step

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algebraic and numerical algorithms

Algorithms and theory of computation handbook
Exact geometric and algebraic computations in CGAL

ICMS'10 Proceedings of the Third international congress conference on Mathematical software
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics

Journal of Symbolic Computation
A generic algebraic kernel for non-linear geometric applications

Proceedings of the twenty-seventh annual symposium on Computational geometry

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.