EXACUS: Efficient and exact algorithms for curves and surfaces. 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.

References in zbMATH (referenced in 24 articles , 1 standard article )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Hemmer, Michael; Dupont, Laurent; Petitjean, Sylvain; Schömer, Elmar: A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (2011)
  2. Karavelas, Menelaos I.: Exact geometric and algebraic computations in CGAL (2010)
  3. Berberich, Eric; Sagraloff, Michael: A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces (2009)
  4. Fogel, Efi: Minkowski sum construction and other applications of arrangements of geodesic arcs on the sphere (2009) ioport
  5. Lazard, Sylvain; Peñaranda, Luis; Tsigaridas, Elias: Univariate algebraic kernel and application to arrangements (2009) ioport
  6. Eigenwillig, Arno; Kerber, Michael: Exact and efficient 2D-arrangements of arbitrary algebraic curves (2008)
  7. Emiris, Ioannis Z.; Mourrain, Bernard; Tsigaridas, Elias P.: Real algebraic numbers: Complexity analysis and experimentation (2008)
  8. Emiris, Ioannis Z.; Tzoumas, George M.: Exact and efficient evaluation of the incircle predicate for parametric ellipses and smooth convex objects (2008) ioport
  9. Berberich, Eric; Fogel, Efi; Halperin, Dan; Mehlhorn, Kurt; Wein, Ron: Sweeping and maintaining two-dimensional arrangements on surfaces: A first step (2007)
  10. Boissonnat, Jean-Daniel (ed.); Teillaud, Monique (ed.): Effective computational geometry for curves and surfaces (2007)
  11. Dupont, Laurent; Hemmer, Michael; Petitjean, Sylvain; Schömer, Elmar: Complete, exact and efficient implementation for computing the adjacency graph of an arrangement of quadrics (2007)
  12. Eigenwillig, Arno; Kerber, Michael; Wolpert, Nicola: Fast and exact geometric analysis of real algebraic plane curves (2007)
  13. Hert, Susan; Hoffmann, Michael; Kettner, Lutz; Pion, Sylvain; Seel, Michael: An adaptable and extensible geometry kernel (2007)
  14. Russel, Daniel; Karavelas, Menelaos I.; Guibas, Leonidas J.: A package for exact kinetic data structures and sweepline algorithms (2007)
  15. Wein, Ron; Fogel, Efi; Zukerman, Baruch; Halperin, Dan: Advanced programming techniques applied to CGAL’s arrangement package (2007)
  16. Eigenwillig, Arno; Kettner, Lutz; Schömer, Elmar; Wolpert, Nicola: Exact, efficient, and complete arrangement computation for cubic curves (2006)
  17. Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael: Reliable and efficient computational geometry via controlled perturbation (2006)
  18. Meyerovitch, Michal: Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces (2006)
  19. Berberich, Eric; Eigenwillig, Arno; Hemmer, Michael; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Reichel, Joachim; Schmitt, Susanne; Schömer, Elmar; Wolpert, Nicola: EXACUS: Efficient and exact algorithms for curves and surfaces (2005)
  20. Berberich, Eric; Hemmer, Michael; Kettner, Lutz; Schömer, Elmar; Wolpert, Nicola: An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra (2005)

1 2 next